Abstract | ||
---|---|---|
We describe how the use of a hierarchy of lexical categories instead of a simple set of categories leads to the definition of a flexible and precise language for the description of dependency structures. After specifying the formalism we use to decorate these structures, we present an application aiming to detect and correct errors in a written text. We outline how the use of the hierarchy improves the manipulation of unknown words. |
Year | DOI | Venue |
---|---|---|
1990 | 10.3115/997939.997963 | COLING |
Keywords | Field | DocType |
precise language,dependency structure,category hierarchy,written text,lexical category,syntactic parsing,correct error,unknown word,simple set | Syntactic parsing,Pattern recognition,Computer science,Simple set,Robustness (computer science),Part of speech,Artificial intelligence,Natural language processing,Formalism (philosophy),Hierarchy | Conference |
Volume | Citations | PageRank |
C90-2 | 5 | 1.07 |
References | Authors | |
10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Damien Genthial | 1 | 16 | 3.73 |
Jacques Courtin | 2 | 16 | 3.06 |
Irène Kowarski | 3 | 5 | 1.07 |