Article

Free access

Two principles of parse preference

Authors:

Jerry R. Hobbs,

John BearAuthors Info & Claims

COLING '90: Proceedings of the 13th conference on Computational linguistics - Volume 3

Pages 162 - 167

https://doi.org/10.3115/991146.991175

Published: 20 August 1990 Publication History

PDF eReader

References

[1]

Bear, John, and Jerry Hobbs, 1988. "Localizing Expression of Ambiguity", Proceedings of the Second Conference on Applied Natural Language Processing, Austin, Texas, pp. 235--241.

Digital Library

Google Scholar

[2]

Bear, John, and Patti Price, 1990. "Prosody, Syntax and Parsing", Proceedings, 28th Annual Meeting of the Association for Computational Linguistics, Pittsburgh, Pennsylvania.

Digital Library

Google Scholar

[3]

Church, Kenneth, 1980. "On Memory Limitations in Natural Language Processing", MIT Technical Report MIT/LCS/TR-245.

Digital Library

Google Scholar

[4]

Ford, Marylyn, Joan Bresnan, and Ronald Kaplan, 1982. "A Competence-Based Theory of Syntactic Closure," in J. Bresnan (Ed.) The Mental Representation of Grammatical Relations, MIT Press: Cambridge, Massachusetts.

Google Scholar

[5]

Frazier, Lyn and Janet Fodor, 1979. "The Sausage Machine: A New Two-Stage Parsing Model", Cognition, Vol. 6, pp. 291--325.

Crossref

Google Scholar

[6]

Hobbs, Jerry R., Mark Stickel, Paul Martin, and Douglas Edwards, 1988. "Interpretation as Abduction", Proceedings, 26th Annual Meeting of the Association for Computational Linguistics, pp. 95--103, Buffalo, New York, June 1988.

Digital Library

Google Scholar

[7]

Kimball, John, 1973. "Seven Principles of Surface Structure Parsing in natural Language", Cognition Vol. 2, No. 1, pp. 15--47.

Crossref

Google Scholar

[8]

Marcus, Mitchel, 1980. A Theory of Syntactic Recognition for Natural Language, MIT Press: Cambridge, Massachusetts.

Digital Library

Google Scholar

[9]

Pereira, Fernando, 1985. "A New Characterization of Attachment Preferences," in D. Dowty et al. (Eds.) Natural Language Processing, Cambridge University Press: Cambridge, England.

Google Scholar

[10]

Schubert, Lenhart, 1984. "On Parsing Preferences", Proceedings, COLING 1984, Stanford, California, pp. 247--250.

Digital Library

Google Scholar

[11]

Schubert, Lenhart, 1986. "Are There Preference Trade-offs in Attachment Decisions?" Proceedings, AAAI 1986, Philadelphia, Pennsylvania, pp. 601--605.

Google Scholar

[12]

Shieber, Stuart, 1983. "Sentence Disambiguation by a Shift-Reduce Parsing Technique", Proceedings, IJCAI 1983, Washington, D.C., pp. 699--703.

Digital Library

Google Scholar

[13]

Wanner, Eric, and Michael Maratsos, 1978. "An ATN Approach to Comprehension," in Halle, Bresnan, and Miller (Eds.) Linguistic Theory and Psychological Reality. MIT Press: Cambridge, Massachusetts.

Google Scholar

[14]

Wilks, Yorick, Xiuming Huang, and Dan Fass, 1985. "Syntax, Preference and Right Attachment", Proceedings, IJCAI 1985, Los Angeles, California, pp. 779--784.

Google Scholar

Cited By

View all

Tsujii J(2011)Computational linguistics and natural language processingProceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I10.5555/1964799.1964806(52-67)Online publication date: 20-Feb-2011
https://dl.acm.org/doi/10.5555/1964799.1964806
Newman PBunt HMerlo P(2007)Symbolic preference using simple scoringProceedings of the 10th International Conference on Parsing Technologies10.5555/1621410.1621421(83-92)Online publication date: 23-Jun-2007
https://dl.acm.org/doi/10.5555/1621410.1621421
Eisner JSmith NBunt HMalouf RLavie A(2005)Parsing with soft and hard constraints on dependency lengthProceedings of the Ninth International Workshop on Parsing Technology10.5555/1654494.1654498(30-41)Online publication date: 9-Oct-2005
https://dl.acm.org/doi/10.5555/1654494.1654498
Show More Cited By

Two principles of parse preference
1. Computing methodologies
  1. Artificial intelligence
2. Hardware
  1. Power and energy
    1. Power estimation and optimization

Recommendations

Preference logic grammars

Preference logic grammars (PLGs) are introduced in this paper as a concise, declarative, modular, and efficient means of resolving ambiguity in logic grammars. Preference logic grammars can be thought as extensions of definite clause grammars (DCGs) and ...
Is it really that difficult to parse German?
EMNLP '06: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing

This paper presents a comparative study of probabilistic treebank parsing of German, using the Negra and TüBa-D/Z tree-banks. Experiments with the Stanford parser, which uses a factored PCFG and dependency model, show that, contrary to previous claims ...
GLL parse-tree generation

Backtracking techniques which are often used to extend recursive descent (RD) parsers can have explosive run-times and cannot deal with grammars with left recursion. GLL parsers are fully general, worst-case cubic parsers which have the recursive ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

COLING '90: Proceedings of the 13th conference on Computational linguistics - Volume 3

August 1990

459 pages

ISBN:9529020287

Editor:
Hans Karlgren
KVAL Research Institute for Information Science, Stockholm, Sweden

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 20 August 1990

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,537 of 1,537 submissions, 100%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
292
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)13

Reflects downloads up to 25 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tsujii J(2011)Computational linguistics and natural language processingProceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I10.5555/1964799.1964806(52-67)Online publication date: 20-Feb-2011
https://dl.acm.org/doi/10.5555/1964799.1964806
Newman PBunt HMerlo P(2007)Symbolic preference using simple scoringProceedings of the 10th International Conference on Parsing Technologies10.5555/1621410.1621421(83-92)Online publication date: 23-Jun-2007
https://dl.acm.org/doi/10.5555/1621410.1621421
Eisner JSmith NBunt HMalouf RLavie A(2005)Parsing with soft and hard constraints on dependency lengthProceedings of the Ninth International Workshop on Parsing Technology10.5555/1654494.1654498(30-41)Online publication date: 9-Oct-2005
https://dl.acm.org/doi/10.5555/1654494.1654498
Johnson MGeman SCanon SChi ZRiezler SDale RChurch K(1999)Estimators for stochastic "Unification-Based" grammarsProceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics10.3115/1034678.1034758(535-541)Online publication date: 20-Jun-1999
https://dl.acm.org/doi/10.3115/1034678.1034758
Satoh KTsujii J(1996)Disambiguation by prioritized circumscriptionProceedings of the 16th conference on Computational linguistics - Volume 210.3115/993268.993324(901-906)Online publication date: 5-Aug-1996
https://dl.acm.org/doi/10.3115/993268.993324
Mitjushin LTsujii J(1996)An agreement corrector for RussianProceedings of the 16th conference on Computational linguistics - Volume 210.3115/993268.993303(776-781)Online publication date: 5-Aug-1996
https://dl.acm.org/doi/10.3115/993268.993303
Azzam SAbney SHinrichs E(1995)An algorithm to co-ordinate anaphora resolution and PPS disambiguation processProceedings of the seventh conference on European chapter of the Association for Computational Linguistics10.3115/976973.977016(284-285)Online publication date: 27-Mar-1995
https://dl.acm.org/doi/10.3115/976973.977016
Alshawi HCarter D(1994)Training and scaling preference functions for disambiguationComputational Linguistics10.5555/203987.20399520:4(635-648)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.5555/203987.203995
Dowding JGawron JAppelt DBear JCherny LMoore RMoran DSchubert L(1993)GeminiProceedings of the 31st annual meeting on Association for Computational Linguistics10.3115/981574.981582(54-61)Online publication date: 22-Jun-1993
https://dl.acm.org/doi/10.3115/981574.981582
McCord M(1993)Heuristics for broad-coverage natural language parsingProceedings of the workshop on Human Language Technology10.3115/1075671.1075700(127-132)Online publication date: 21-Mar-1993
https://dl.acm.org/doi/10.3115/1075671.1075700
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Preference logic grammars

Is it really that difficult to parse German?

GLL parse-tree generation

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations