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 accordance with a Formalized Natural Language, said method comprising the steps of:
- storing, in a computer readable medium, data in electronic form comprising a text grammar of said Formalized Natural Language representing an infinite set of texts of type Text, said computer readable medium and said data stored constituting a text grammar device,receiving by said computer from an input device, 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 of said text grammar device, andoutputting said parsed linguistic input data by said computer from a data output device.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, device and computer program product for processing, in a computer system, linguistic data in accordance with a grammar of a Formalized Natural Language. The grammar of the Formalized Natural language is a text grammar operating on a set of texts of type Text. 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 data to be processed are acquired and processed in accordance with the Formalized Natural Language. A physical representation of a processed syntactic and semantic structure of the linguistic data is provided.
-
Citations
37 Claims
-
1. A computer controlled method for parsing linguistic input data in accordance with a Formalized Natural Language, said method comprising the steps of:
-
storing, in a computer readable medium, data in electronic form comprising a text grammar of said Formalized Natural Language representing an infinite set of texts of type Text, said computer readable medium and said data stored constituting a text grammar device, receiving by said computer from an input device, 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 of said text grammar device, and outputting said parsed linguistic input data by said computer from a data output device. - 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, 32, 33, 34, 35, 36, 37)
-
-
29. A device, comprising computer processing means, for parsing linguistic input data in accordance with a Formalized Natural Language, said device comprising:
-
a computer readable medium storing data in electronic form comprising a text grammar of said Formalized Natural language representing an infinite set of texts of type Text said computer readable medium and said data stored constituting a text grammar device, 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 of said text grammar device, and a data output device for outputting said parsed linguistic input data.
-
-
30. A computer readable medium storing data in electronic form comprising a lexicon of type Lexicon comprising a list of items 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.
-
31. (canceled)
Specification