Concept-oriented parsing of definitions
Pages 988 - 992
Abstract
No abstract available.
References
[1]
Alshawi, H., Analysing the dictionary definitions, in: B. Boguraev and T. Briscoe, (Eds.), Computational Lexicography for Natural Language Processing, London/New York, 1989, 153--169.
[2]
Burkert G. and P. Forster, Representation of semantic knowledge with term subsumption languages, ms., Stuttgart, 1991.
[3]
Habel, C., Das Lexikon in der Forschung der künstlichen Intelligenz, in: C. Schwarze and D. Wunderlich, (Eds.), Handbuch der Lexikologie, Königstein, 1985, 441--474.
[4]
Mars, V. e.a., Eindrapportage Sapiens-project, UT-gedeelte, Twente, 1991.
[5]
Martin, W. e.a., Over Atlex, Relset, Conceptor e.a., VU-bijdrage tot het Sapiens-prototype, Amsterdam, 1991.
[6]
Martin, W. e.a., Dilemma, an automatic lemmatizer, in: Colingua, 1988, 5--62.
[7]
Martin W. and E. Ten Pas, Metatools for Terminology, in: Corpusgebaseerde Woordanalyse, Jaarboek 1991, Amsterdam, 1991, 83--99.
[8]
H. Paulussen and W. Martin, Dilemma-2: a lemmatizer-tagger for medical abstracts, Third conference on Applied Natural Language Processing, Trento, 1--3 April 1992, ACL Morristown 1992, 141--146.
[9]
M. Reedijk, Een conceptuele parser voor definities van medische termen, ms., Amsterdam, 1991.
[10]
Winograd, T., Language as a cognitive process. Vol. 1: Syntax, Addison-Wesley, 1983.
- Concept-oriented parsing of definitions
Recommendations
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
Parsing expression grammars: a recognition-based syntactic foundation
POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languagesFor decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- SITE
- Ministère de la recherche et de la technologie
- Ville de Nantes
- Univ.s de Grenoble
- Ministère des Affairs Étrangères
- Conseil Général de Loire Atlantique
- CNRS: Centre National De La Rechercue Scientifique
- Univ. de Nantes
- ATALA
- ACL
- AFCET
- IMAG
Publisher
Association for Computational Linguistics
United States
Publication History
Published: 23 August 1992
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 1,537 of 1,537 submissions, 100%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025