Method, device, computer program and computer program product for processing linguistic data in accordance with a formalized natural language
First Claim
1. A computer controlled method for parsing linguistic input data in a computer, said method comprising the steps of:
- storing, in a computer readable storage medium of said computer, data comprising a text grammar of a Formalized Natural Language, the text grammar comprising a finite set of elements that represent a set of texts of a human language, wherein said text grammar of said Formalized Natural Language defines a finite set W of words of type Word which is stored in a lexicon of type Lexicon, comprising a finite set of lexical words of type LexWord, in such a way that each lexical word is constructed as a tuple of one unique word form and a list of disjunctive grammar forms, and each grammar form is constructed as a tuple of a unique category and a list of disjunctive feature sequences, and every feature is constructed as a string referring to a set of disjunctive instances of a feature,receiving by said computer said linguistic input data to be parsed,parsing said received linguistic input data by said computer in accordance with said text grammar of said Formalized Natural Language, andgenerating parsed linguistic output data that is consistent for every instance when said linguistic input data is provided to said computer.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, device and computer program product for parsing linguistic input data by a computer system, in accordance with a grammar of a Formalized Natural Language. The grammar of the Formalized Natural language is a text grammar representing an infinite set of texts of type Text and is stored in electronic form in a computer readable medium constituting a text grammar device. This text grammar is defined by a set of four elements W, N, R and Text. W is a finite set of invariable words of type Word, to be used as terminal, elementary expressions of a text. N is a finite set of non-terminal help symbols, to be used for the derivation and the representation of texts. R is a finite set of inductive rules for the production of grammatical expressions of the Formalized Natural Language, and Text is an element of N and start-symbol for grammatical derivation of all texts of type Text of the Formalized Natural Language. Linguistic input data to be parsed are received from an input device acquired and parsed by the computer system in accordance with the Formalized Natural Language of the text grammar device. A physical representation of a syntactic and semantic structure of the parsed linguistic input data is provided by a data output device.
-
Citations
34 Claims
-
1. A computer controlled method for parsing linguistic input data in a computer, said method comprising the steps of:
-
storing, in a computer readable storage medium of said computer, data comprising a text grammar of a Formalized Natural Language, the text grammar comprising a finite set of elements that represent a set of texts of a human language, wherein said text grammar of said Formalized Natural Language defines a finite set W of words of type Word which is stored in a lexicon of type Lexicon, comprising a finite set of lexical words of type LexWord, in such a way that each lexical word is constructed as a tuple of one unique word form and a list of disjunctive grammar forms, and each grammar form is constructed as a tuple of a unique category and a list of disjunctive feature sequences, and every feature is constructed as a string referring to a set of disjunctive instances of a feature, receiving by said computer said linguistic input data to be parsed, parsing said received linguistic input data by said computer in accordance with said text grammar of said Formalized Natural Language, and generating parsed linguistic output data that is consistent for every instance when said linguistic input data is provided to said computer. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31, 32, 33, 34)
-
-
29. A device comprising:
-
a computer readable storage medium storing data comprising a text grammar of a Formalized Natural language, the text grammar comprising a finite set of elements that represent a set of texts of a human language, wherein said text grammar of said Formalized Natural Language defines a finite set W of words of type Word which is stored in a lexicon of type Lexicon, comprising a finite set of lexical words of type LexWord, in such a way that each lexical word is constructed as a tuple of one unique word form and a list of disjunctive grammar forms, and each grammar form is constructed as a tuple of a unique category and a list of disjunctive feature sequences, and every feature is constructed as a string referring to a set of disjunctive instances of a feature, an input device for receiving said linguistic input data to be parsed, processing means for parsing said received linguistic input data in accordance with said text grammar of said Formalized Natural Language, and a data output device for outputting parsed linguistic data, wherein said parsed linguistic data is consistent for every instance when said linguistic input data is provided to said input device.
-
-
30. A computer readable storage medium that is not a transient signal, the computer readable medium storing instructions for parsing linguistic input data, said instructions executable for:
-
receiving said linguistic input data to be parsed, parsing said linguistic input data using a lexicon of a Formalized Natural Language, the lexicon accessible by a computer for parsing linguistic input data, the lexicon comprising a finite set of lexical words of type LexWord in such a way that one lexical word contains all the different words of type Word with one common word form, which word form is able to satisfy a given list of different disjunctive grammar forms, each grammar form given as a tuple of a unique category and a list of all its disjunctive meanings, every meaning constituting a feature sequence wherein each feature is constructed as a string indicating disjunctive instances of said feature, and outputting parsed linguistic data, wherein said parsed linguistic data is consistent for every instance when said linguistic input data is provided to said computer.
-
Specification