Name
Abstract | ||
|---|---|---|
We give a simple grammatical characterization of the notion of suffix redundancy presented procedurally in a recent article
by Fischer and Mauney. It is shown that certain properties of grammars related to suffix redundancy can be decided at parser
generation time. Some suggestions concerning efficiency of repair attempts conclude the article. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/BF03036468 | Acta Inf. |
Keywords | Field | DocType |
Terminal Symbol,Parse Time,Regular Grammar,Repair Attempt,Error Repair | Rule-based machine translation,Terminal and nonterminal symbols,Suffix,Computer science,Grammar,Redundancy (engineering),Natural language processing,Artificial intelligence,Regular grammar,Parsing | Journal |
Volume | Issue | ISSN |
33 | 7 | 0001-5903 |
Citations | PageRank | References |
2 | 0.41 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eberhard Bertsch | 1 | 63 | 26.54 |