Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Topic List  Advanced Search  
Sample search results for: abandoned parses facilitate

Page:   2  3  4  5 
 
1 A* Parsing: Fast Exact Viterbi Parse Selection Computer Science Department
 

Summary:  -initial PP must be abandoned; the best score drops to -13.9, backed by the parse in fig- ure 2(b). Specifying... A* Parsing: Fast Exact Viterbi Parse Selection Dan Klein Computer Science Department Stanford... of the classic A* search procedure to tabular PCFG parsing. The use of A* ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
2 A* Parsing: Fast Exact Viterbi Parse Selection Computer Science Department
 

Summary:  A* Parsing: Fast Exact Viterbi Parse Selection Dan Klein Computer Science Department Stanford... of the classic A* search procedure to tabular PCFG parsing. The use of A* search can dramatically reduce the time... required to find a best parse by conservatively estimating the probabilities of ...

  

Source: Chang, Edward Y. - Department of Electrical and Computer Engineering, University of California at Santa Barbara; Zakhor, Avideh - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collection: Computer Technologies and Information Sciences ; Engineering

 
3 A* Parsing: Fast Exact Viterbi Parse Selection Computer Science Department
 

Summary:  -initial PP must be abandoned; the best score drops to -13.9, backed by the parse in fig- ure 2(b). Specifying... A* Parsing: Fast Exact Viterbi Parse Selection Dan Klein Computer Science Department Stanford... of the classic A* search procedure to tabular PCFG parsing. The use of A* ...

  

Source: Manning, Christopher - Department of Computer Science, Stanford University; Zakhor, Avideh - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collection: Computer Technologies and Information Sciences ; Engineering

 
4 A Backtracking LR Algorithm for Parsing Ambiguous Context-Dependent Languages
 

Summary:  A Backtracking LR Algorithm for Parsing Ambiguous Context-Dependent Languages Adrian D. Thurston... }@cs.queensu.ca Abstract Parsing context-dependent computer lan- guages requires an ability to maintain and query data... structures while parsing for the purpose of influencing the parse. ...

  

Source: Cordy, James R. - School of Computing, Queen's University (Kingston)

 

Collection: Computer Technologies and Information Sciences

 
5 A Backtracking LR Algorithm for Parsing Ambiguous Context-Dependent Languages
 

Summary:  A Backtracking LR Algorithm for Parsing Ambiguous Context-Dependent Languages Adrian D. Thurston... }@cs.queensu.ca Abstract Parsing context-dependent computer lan- guages requires an ability to maintain and query data... structures while parsing for the purpose of influencing the parse. ...

  

Source: Queen's University (Kingston), School of Computing, Software Technology Laboratory

 

Collection: Computer Technologies and Information Sciences

 
6 Flexible Parsing i Philip J. Hayes
 

Summary:  with bottom-up parsing, because it facilitates recognition of utterances with omissions and substitutions... case the active parse should be abandoned and a new parse started from that point. · The input could... Flexible Parsing i Philip J. Hayes George V. Mouradian ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
7 Statistical Parsing of Messages Mahesh V. Chitrao and Ralph Grishman
 

Summary:  is imposed on the number of edges the parser can generate before abandoning the search for the parse... Statistical Parsing of Messages Mahesh V. Chitrao and Ralph Grishman Department of Computer Science... one designed for the task of parsing edited English. This can result in a proliferation of ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
8 Best-first Word-lattice Parsing: Techniques for integrated syntactic language modeling
 

Summary:  Best-first Word-lattice Parsing: Techniques for integrated syntactic language modeling by Keith B... Processing models. The focus of this thesis is to explore the integration of statistical parsing techniques... Figure 1: A partial syntactic parse with head-word annotations. Using a relatively simple syntactically

  

Source: Hall, Keith - Center for Language and Speech Processing, Johns Hopkins University

 

Collection: Computer Technologies and Information Sciences

 
9 Linguistic Resources for Speech Parsing , Stephanie Strassela
 

Summary:  facilitate the evaluation of parse accuracy in a fully-automated system (i.e., parsing ASR words... Linguistic Resources for Speech Parsing Ann Biesa , Stephanie Strassela , Haejoong Leea , Kazuaki... synergistic work on speech parsing and structural event detection. Automatic detection ...

  

Source: Liu, Yang - Department of Computer Science, University of Texas at Dallas

 

Collection: Computer Technologies and Information Sciences

 
10 PARSING GERMAN TOPOLOGICAL FIELDS WITH PROBABILISTIC CONTEXT-FREE GRAMMARS
 

Summary:  PARSING GERMAN TOPOLOGICAL FIELDS WITH PROBABILISTIC CONTEXT-FREE GRAMMARS by Jackie Chi Kit Cheung... of Computer Science University of Toronto Copyright c 2009 by Jackie Chi Kit Cheung #12;2 Abstract Parsing... parsing has produced a number of high- performance parsers using probabilistic context-free (PCFG) models

  

Source: Toronto, University of - Department of Computer Science, Computational Linguistics Group

 

Collection: Computer Technologies and Information Sciences

 
11 Lexicalised Configuration Grammars Robert Grabowski, Marco Kuhlmann, and Mathias Mohl
 

Summary:  to encode a large number of existing grammar formalisms, facilitating their comparison from the perspective... , this makes it possible to model syntactic phenomena in novel ways. Parsing algorithms for lcgs lend... that lcg facilitates a rather detailed analysis of the implications that these two changes have in terms

  

Source: Will, Sebastian - Lehrstuhl für Bioinformatik, Institut für Informatik, Albert-Ludwigs-Universität Freiburg

 

Collection: Computer Technologies and Information Sciences ; Biology and Medicine

 
12 Ph.D. Proposal, Department of Computer Sciences, University of Texas at Austin, May 2000
 

Summary:  Integrating Statistical and Relational Learning for Semantic Parsing: Applications to Learning Natural... ­ cal semantic parsing. Initial experimental results from three different domains suggest... that an integration of statistical and logical approaches to semantic parsing can out­ perform a purely logical

  

Source: Mooney, Raymond J. - Department of Computer Sciences, University of Texas at Austin

 

Collection: Computer Technologies and Information Sciences

 
13 Adam Pauls and Dan Klein Computer Science Division
 

Summary:  the exhaustive parsing needed for EXH in our agenda-based parser to facilitate compar- ison. For KA , we included... K-Best A Parsing Adam Pauls and Dan Klein Computer Science Division University of California... , Berkeley {adpauls,klein}@cs.berkeley.edu Abstract A parsing makes 1-best search efficient by ...

  

Source: Zakhor, Avideh - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collection: Engineering ; Computer Technologies and Information Sciences

 
14 Proceedings of the 47th Annual Meeting of the ACL and the 4th IJCNLP of the AFNLP, pages 958966, Suntec, Singapore, 2-7 August 2009. c 2009 ACL and AFNLP
 

Summary:  the exhaustive parsing needed for EXH in our agenda-based parser to facilitate compar- ison. For KA , we included... ­966, Suntec, Singapore, 2-7 August 2009. c 2009 ACL and AFNLP K-Best A Parsing Adam Pauls and Dan Klein... A parsing makes 1-best search efficient by suppressing unlikely 1-best items. ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
15 Generalizing Semantic Role Annotations Across Syntactically Similar Verbs
 

Summary:  in which the parse tree path is possible. As a representative ex- ample, 95 verb forms of abandon were... @ict.usc.edu swansonr@ict.usc.edu Abstract Large corpora of parsed sentences with semantic role labels (e.g. Prop... ) corpus of semantic role annotations of Tree- bank parses contained 112,917 labeled ...

  

Source: Gordon, Andrew S. - Institute for Creative Technologies, University of Southern California

 

Collection: Computer Technologies and Information Sciences

 
16 A FEATURE-BASED MODEL FOR LEXICAL DATABASES JEAN VRONIS, NANCY IDE
 

Summary:  dictionary data, in order to facilitate retrieval and analysis. However, lexical data is much more complex... for abandon in Fig. 1 has two main sub-parts, one for its verb senses and one for its noun sense, and the two... ; Roth et al., 1988). Fig. 2 shows the LDOCE entry for abandon represented in a NF2 model. The outermost

  

Source: Ide, Nancy - Department of Computer Science, Vassar College

 

Collection: Computer Technologies and Information Sciences

 
17 A Robust Grammar Focused Parser for Spontaneously Spoken Language
 

Summary:  . Parsing spontaneous speech must, however, also deal with problems such as speech disfluencies, the looser... parsing algorithms are designed to analyze "clean" grammatical input. Because they reject any input which... is found to be ungrammatical in even the slightest way, such parsers are unsuitable for parsing spontaneous

  

Source: Lavie, Alon - Language Technologies Institute, School of Computer Science, Carnegie Mellon University

 

Collection: Computer Technologies and Information Sciences

 
18 Treebank Grammars and Other Infinite Parameter Models
 

Summary:  the different parses in order to facilitate the selection of the most probable one. Clearly, if we had access... utterance. This paper discusses parsing/disambiguation systems which are based on proba- bilistic grammars... parse-tree probability distributions arbitrarily closely. But #12;this power has a ...

  

Source: Amsterdam, University of, Institute for Logic, Language and Computation (ILLC)

 

Collection: Computer Technologies and Information Sciences

 
19 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING: SPECIAL ISSUE ON SOFTWARE LANGUAGE ENGINEERING 1 Grammar Recovery from Parse Trees and
 

Summary:  , grammar refac- toring, grammar metrics, parse tree I. INTRODUCTION TO facilitate the software development... that result from delayed parsing or tentative parsing, which is parsing that is abandoned in favor... Recovery from Parse Trees and ...

  

Source: Hallstrom, Jason - Department of Computer Science, Clemson University

 

Collection: Computer Technologies and Information Sciences

 
20 A FEATURE-BASED MODEL FOR LEXICAL DATABASES JEAN VI~RONIS,NANCYIDE
 

Summary:  original dictionary data, in order to facilitate retrieval and analysis. However, lexical data is much more... for abandon in Fig. 1 has two main sub-parts, one for its verb senses and one for its noun sense, and the two... and Bidoit, 1984; Roth et al., 1988). Fig. 2 shows the LDOCE entry for abandon represented in a NF2 model

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences


Page:   2  3  4  5 
Page:   1  2  3  4  5 
 
21 A Coroutine Approach to Parsing HANAN SAMET
 

Summary:  generator, etc. In this paper we use a similar coroutine organization to facilitate the one-pass parsing... A Coroutine Approach to Parsing HANAN SAMET University of Maryland A method is presented... for parsing syntactic constructs that are permitted to appear independently anywhere in a program. Some

  

Source: Samet, Hanan - Institute for Advanced Computer Studies & Department of Computer Science, University of Maryland at College Park

 

Collection: Computer Technologies and Information Sciences

 
22 Efficiency Considerations for LFG-Parsers -Incremental and Table-Lookup Techniques
 

Summary:  be innmdiately abandoned (Winograd 1'483, 108-115; Phillips 1984; Hellwig 1988). Parsing tables... . Lexicon is separated, ll(k)-parsing tables are used and some preliminary ratifications are carried out... -structures simultaneously with the processing of the c-stru~:tures. 1 General Considerations of Parsing ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
23 Universit a di Pisa Dipartimento di Informatica
 

Summary:  is not considered complete (and thus the corresponding rule is not applicable). #15; early abandon of a parse... 2212726 #12; #12; The Cico Domain-Based Parser Vincenzo Gervasi Abstract Domain-based parsing is a shallow... parsing technique that exploits knowledge about domain-speci#12;c properties of terms ...

  

Source: Gervasi, Vincenzo - Dipartimento di Informatica, Università di Pisa

 

Collection: Computer Technologies and Information Sciences

 
24 Proceedings of the Student Research Workshop associated with RANLP 2011, pages 7984, Hissar, Bulgaria, 13 September 2011.
 

Summary:  - lows an integration into the incremental dia- logue system Jindigo and facilitates the gen- eration... integration with parsing, and the incorporation of self-repair in a natural and context-sensitive way... (t), arrive(john) Ty(e), john Ty(e t), x.arrive(x) In DS parsing, if the pointer object () currently

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
25 PROFER: PREDICTIVE, ROBUST FINITE-STATE PARSING FOR SPOKEN LANGUAGE Edward C. Kaiser, Michael Johnston and Peter A. Heeman
 

Summary:  -Right parser [1]. The second facilitates run-time parsing and the formation of prediction sets. It holds top... PROFER: PREDICTIVE, ROBUST FINITE-STATE PARSING FOR SPOKEN LANGUAGE Edward C. Kaiser, Michael... parsers, while combining the elements of both. 1. INTRODUCTION Parsing spontaneousspeech is difficult

  

Source: Heeman, Peter - Division of Biomedical Computer Science, Oregon Health and Science University

 

Collection: Computer Technologies and Information Sciences

 
26 Real-Time Detection of Abandoned and Removed Objects in Complex Environments
 

Summary:  Real-Time Detection of Abandoned and Removed Objects in Complex Environments Ying-li Tian, Rogerio... present a new framework to robustly and efficiently detect abandoned and removed objects in complex... regions (i.e., static blobs potentially corresponding to abandoned or removed objects) without extra

  

Source: Ecole Polytechnique, Centre de mathématiques

 

Collection: Mathematics

 
27 Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 192199, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics
 

Summary:  @ict.usc.edu Abstract Large corpora of parsed sentences with semantic role labels (e.g. PropBank) pro- vide training... annotations of Tree- bank parses contained 112,917 labeled instances of 4,250 rolesets corresponding to 3... processing applications that require only shallow semantic parsing. As with all machine-learning ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
28 Generalizing Semantic Role Annotations Across Syntactically Similar Verbs
 

Summary:  in which the parse tree path is possible. As a representative ex- ample, 95 verb forms of abandon were... @ict.usc.edu swansonr@ict.usc.edu Abstract Large corpora of parsed sentences with semantic role labels (e.g. Prop... ) corpus of semantic role annotations of Tree- bank parses contained 112,917 labeled ...

  

Source: Southern California, University of - Institute for Creative Technologies, Graphics Lab

 

Collection: Computer Technologies and Information Sciences

 
29 A Parallel Approach to XML Parsing , Kenneth Chiu 2
 

Summary:  A Parallel Approach to XML Parsing Wei Lu #1 , Kenneth Chiu 2 , Yinfei Pan 3 # Computer Science... , we present a seemingly quixotic, but novel approach: parallel XML parsing. Parallel XML parsing... of parallel XML parsing. Our design consists of an initial preparsing phase to determine the structure

  

Source: State University of New York at Binghamton, Department of Computer Science, Grid Computing Research Laboratory

 

Collection: Computer Technologies and Information Sciences

 
30 Lexicase Parsing: A Lexicon-driven App.roach. to Syntactic Analysis Stanley STAROSTA
 

Summary:  to radically simplify a grammar and the associated lexicon in ways which facilitate parsing, as detailed below... Lexicase Parsing: A Lexicon-driven App.roach. to Syntactic Analysis Stanley STAROSTA University... analysis, l,exicase, and applies it to a lexicon driven computatlolml parsing system. The basic ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
31 Entity-Oriented Parsing Philip J. Hayes
 

Summary:  , it facilitates fragmentary recognition and the use of multiple parsing strategies, and so is particularly useful... in the parse are abandoned. This means that the agenda mechanism never activates any continuations... Entity-Oriented Parsing Philip J. Hayes Computer Science Department, ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
32 Proceedings of the Ninth International Workshop on
 

Summary:  into isolated terminals, in order to guarantee that any input is parsed, and in particular not to abandon... IWPT-05 Proceedings of the Ninth International Workshop on Parsing Technologies 9­10 October 2005... International Workshop on Parsing Technologies continues the tradition that was started with the ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
33 A Hybrid Connectionist Shift Reduce Parser
 

Summary:  . The parser returned a set of parse trees for each sentence, and for each parse tree a con#12;dence factor... based on the average strength of the neural network's responses during the parsing process. The main #12... ;ndings of the project were that the use of a neural network in this way permitted parsing ...

  

Source: Hammerton, James - Alfa Informatica, Rijksuniversiteit Groningen

 

Collection: Computer Technologies and Information Sciences

 
34 Deep dependencies from contextfree statistical parsers: correcting the surface dependency approximation
 

Summary:  ­coverage context­free parse trees derived from treebanks. We use an algorithm based on loglinear classifiers... trees and 5% error reduction on state­of­ the­art machine­parsed input trees, when compared... in context­free parse trees are a poorer approximation to underlying dependency structure. 1 Introduction

  

Source: Manning, Christopher - Department of Computer Science, Stanford University

 

Collection: Computer Technologies and Information Sciences

 
35 Deep dependencies from context-free statistical parsers: correcting the surface dependency approximation
 

Summary:  -coverage context-free parse trees derived from treebanks. We use an algorithm based on loglinear classifiers... trees and 5% error reduction on state-of- the-art machine-parsed input trees, when compared... in context-free parse trees are a poorer approximation to underlying dependency structure. 1 Introduction

  

Source: Association for Computational Linguistics (ACL) Anthology; Manning, Christopher - Department of Computer Science, Stanford University

 

Collection: Computer Technologies and Information Sciences

 
36 A # Parsing: Fast Exact Viterbi Parse Selection Dan Klein and Christopher D. Manning
 

Summary:  A # Parsing: Fast Exact Viterbi Parse Selection Dan Klein and Christopher D. Manning Computer... * PCFG parsing can dramatically reduce the time required to find the exact Viterbi parse... number of edges processed to less than 3% of that re­ quired by exhaustive parsing, and even a sim­ ...

  

Source: Manning, Christopher - Department of Computer Science, Stanford University

 

Collection: Computer Technologies and Information Sciences

 
37 Attention Shifting for Parsing Speech Department of Computer Science
 

Summary:  to abandon analy- ses of parts of the word-lattice for which complete parses exist. Following this... Attention Shifting for Parsing Speech Keith Hall Department of Computer Science Brown University... the efficiency of word-lattice parsing as used in speech recogni- tion language modeling. Our technique ...

  

Source: Association for Computational Linguistics (ACL) Anthology; Hall, Keith - Center for Language and Speech Processing, Johns Hopkins University

 

Collection: Computer Technologies and Information Sciences

 
38 Probabilistic Prediction and Picky Chart Parsing* David M. Magerman
 

Summary:  Probabilistic Prediction and Picky Chart Parsing* David M. Magerman Stanford University magerman... agenda-based chart parsing algorithm which uses a technique called prob- abilistic prediction to predict... which grammar rules are likely to lead to an acceptable parse of the input. In tests on ran- domly

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
39 Dissertation ETH Nr. 18700 A Rule-based Language Model
 

Summary:  . . . . . . . . . . . . . . . . . . . . . . . . 58 4.3.1 Robust Parsing . . . . . . . . . . . . . . . . . . . . 58 4.3.2 Implementation Details... . . . . . . . . . . . . . . . . . . . . . . . . . . 92 5.3.1 Parsing Algorithm . . . . . . . . . . . . . . . . . . 93 5.3.2 Optimizations... Expressions . . . . . . . . . . . . . . . . . . . . 134 6.4 ...

  

Source: Eidgenössische Technische Hochschule Zürich (ETHZ), Institut für Technische Informatik und Kommunikationsnetze (TIK), Speech Processing Group

 

Collection: Computer Technologies and Information Sciences

 
40 Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 811818, Sydney, July 2006. c 2006 Association for Computational Linguistics
 

Summary:  2006. c 2006 Association for Computational Linguistics A Comparison of Alternative Parse Tree Paths... utilized parse tree paths as predictive features, which encode the path between a verb predicate and a node... in the parse tree that governs its argument. In this paper, we explore a number of alternatives for how

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences


Page:   1  2  3  4  5 
Page:   1  2  3  4  5 
 
41 A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles
 

Summary:  A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles Reid Swanson and Andrew S... statisti- cal approaches to automated predicate- argument annotation have utilized parse tree paths... as predictive features, which encode the path between a verb predicate and a node in the parse tree that governs

  

Source: Gordon, Andrew S. - Institute for Creative Technologies, University of Southern California

 

Collection: Computer Technologies and Information Sciences

 
42 The TACITUS System: The MUC3 Experience
 

Summary:  by the already developed DIALOGIC parser and grammar; only the correct parse was chosen and passed... #ort in the implementation of heuristics for choosing the right parse. We do not view this as the ideal way of handling... incorrectly classified as nouns will still parse as prenominal nouns in compound nominals. The grammar

  

Source: Hobbs, Jerry R. - Information Sciences Institute, University of Southern California

 

Collection: Computer Technologies and Information Sciences

 
43 The TACITUS System: The MUC-3 Experience
 

Summary:  by the already developed DIALOGIC parser and grammar; only the correct parse was chosen and passed... in the implementation of heuristics for choosing the right parse. We do not view this as the ideal way of handling... incorrectly classified as nouns will still parse as prenominal nouns in compound nominals. The grammar

  

Source: Hobbs, Jerry R. - Information Sciences Institute, University of Southern California

 

Collection: Computer Technologies and Information Sciences

 
44 A Robust Grammar-Focused Parser for Spontaneously Spoken Language
 

Summary:  . The GLR* parsing architecture can facilitate the extraction of these meaningful clauses from the utterance... : Natural Language Processing, Speech Understanding, Machine Translation, Parsing, Generalized LR Parsing... in spoken language as well. Parsing spontaneous speech must, however, ...

  

Source: Lavie, Alon - Language Technologies Institute, School of Computer Science, Carnegie Mellon University

 

Collection: Computer Technologies and Information Sciences

 
45 Efficiency, Robustness and Accuracy in Picky Chart
 

Summary:  , CA 94305 magerman@cs.st anford.edu Parsing* Carl Weir Paramax Systems Paoli, PA 19301 weir... @prc.unisys.com ABSTRACT This paper describes Picky, a probabilistic agenda-based chart parsing algorithm which uses... to an acceptable parse of the input. Using a subopti- mal search method, "Pickysignificantly reduces the number

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
46 Proceedings of the ACL 2007 Workshop on Deep Linguistic Processing, pages 128135, Prague, Czech Republic, June, 2007. c 2007 Association for Computational Linguistics
 

Summary:  feature largely facilitates the efficient searching for best partial parses described in later sections. 3... Republic, June, 2007. c 2007 Association for Computational Linguistics Partial Parse Selection for Robust... @clsp.jhu.edu Abstract This paper presents an approach to partial parse selection for ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
47 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, pages 736744, MIT, Massachusetts, USA, 9-11 October 2010. c 2010 Association for Computational Linguistics
 

Summary:  from this strategy by abandoning the preliminary ranking and predicting se- mantic roles at parse time... predictions in choosing a single-best parse. This process relies on an averaged perceptron model... to distinguish likely semantic roles from erroneous ones. Our system pe- nalizes parses that give rise ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
48 Department of Computer Science Lund University
 

Summary:  development of languages defined by grammars. Parsing is done according to the current state of the grammar... ­oriented recursive­descent parsing algorithm. Keywords structure editing, grammar interpretation, language laboratory... , lan­ guage­based environments, application languages, recursive­descent parsing, ...

  

Source: Lunds Universitet, Department of Computer Science, Computer Graphics Group

 

Collection: Computer Technologies and Information Sciences

 
49 Fast LR Parsing Using Rich (Tree Adjoining) Grammars Carlos A. Prolo
 

Summary:  Fast LR Parsing Using Rich (Tree Adjoining) Grammars Carlos A. Prolo Department of Computer... the intuition that LR parsing benefits from the use of rich grammars. 1 Introduction The LR approach for parsing... has long been con- sidered for natural language parsing (Lang, 1974; Tomita, 1985; Wright and ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
50 SEXTANT 151 Characteristic A B C D E F G
 

Summary:  be directly compared to the much harder problem of nding the correct hierarchical parse of the entire sentence... , since we use a tagger that makes these choices before parsing, these characteristics evaluate the ac... attachment of noun compounds (marked NN in Figure 9.7) during parsing, such as in \insertion point". We

  

Source: Sutcliffe, Richard - Department of Computer Science and Information Systems, University of Limerick

 

Collection: Computer Technologies and Information Sciences

 
51 SEXTANT 151 Characteristic A B C D E F G
 

Summary:  of finding the correct hierarchical parse of the entire sentence. Tables 9.1 and 9.5.3 use an IPSM... a tagger that makes these choices before parsing, these characteristics evaluate the ac­ curacy... compounds (marked NN in Figure 9.7) during parsing, such as in ``insertion point''. We counted the parser

  

Source: Sutcliffe, Richard - Department of Computer Science and Information Systems, University of Limerick

 

Collection: Computer Technologies and Information Sciences

 
52 Decision Procedures for Dependency Parsing Using Graded Constraints
 

Summary:  Decision Procedures for Dependency Parsing Using Graded Constraints Wolfgang Menzel and Ingo Schr... n-Strage 30, 22527 Hamburg, Germany I Abstract We present an approach to the parsing of depen- dency... structures which brings together the no- tion of parsing as candidate elimination, the use of graded

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
53 Beyond Lazy XML Parsing1 Fernando Farfn, Vagelis Hristidis, Raju Rangaswami
 

Summary:  Beyond Lazy XML Parsing1 Fernando Farfán, Vagelis Hristidis, Raju Rangaswami School of Computer... applications. However, wide adoption of XML is hindered by inefficient document-parsing methods. Recent work... on lazy parsing is a major step towards alleviating this problem. However, lazy parsers must still read

  

Source: Hristidis, Vagelis - School of Computer Science, Florida International University

 

Collection: Computer Technologies and Information Sciences

 
54 A Distributed Architecture for Interactive Parse Annotation Baden Hughes
 

Summary:  ) and widely adopted as a standard format. To facilitate the re-use of the rendered parse tree, our gui uses... A Distributed Architecture for Interactive Parse Annotation Baden Hughes Department of Computer... @it.usyd.edu.au Abstract In this paper we describe a modular system ar- chitecture for distributed ...

  

Source: Curran, James R. - School of Information Technologies, University of Sydney

 

Collection: Computer Technologies and Information Sciences

 
55 Proceedings of the Australasian Language Technology Workshop 2005, pages 207214, Sydney, Australia, December 2005.
 

Summary:  ) and widely adopted as a standard format. To facilitate the re-use of the rendered parse tree, our gui uses... , December 2005. A Distributed Architecture for Interactive Parse Annotation Baden Hughes Department... @it.usyd.edu.au Abstract In this paper we describe a modular system ar- chitecture for distributed ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
56 Session 7: Natural Language II Salim Roukos
 

Summary:  (parse tree) in which A occurs. As has transpired in the discussion period, this strong assump- tion... number of parses (say that the correct parse is with probability 99% in the top N parses where N is some... agreed upon number.) · Standard blind test sets annotated with the correct ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
57 Report from the Text Analysis Techniques Topic Session Robert E. Stumberger
 

Summary:  facilitate semantic processing, and to be robust enough to produce partial parses which are usable in late r... correction of Japanese word segmentation (Sean Boisen, BBN) , · principle-based parsing (Robert Belvin... will be extended to parsing in the future . 341 #12;SOME ASPECTS OF PRINCIPLE-BASED ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
58 THE VOYAGER SPEECH UNDERSTANDING SYSTEM: A PROGRESS REPORT* Victor Zue, James Glass, David Goodine, Hong Leung,
 

Summary:  interpretation of the set of words. The parse generated by the natural language component is subsequently... in the signal in order to facilitate acoustic- phonetic feature extraction. The system can be trained... consonants, for example, to facilitate the decoding of context-dependent models. The rule-writing process

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
59 IMPROVED PORTABILITY AND PARSING THROUGH INTERACTIVE ACQUISITION OF SEMANTIC INFORMATION t
 

Summary:  IMPROVED PORTABILITY AND PARSING THROUGH INTERACTIVE ACQUISITION OF SEMANTIC INFORMATION t Francois... -verb- object) found in partially constructed parses. The module has proved to be a valuable tool for port- ing... results also indicate that SPQR causes a threefold reduction in the number of parses found, and about a 40

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
60 Compiling and Using Finite-StateSyntactic Rules Kimmo Koskenniemi, Pasi Tapanainen and Atro Voutilainen
 

Summary:  to be large contain- Ing maybe a few hundred finite-state rules. In order to facilitate the parsing... ..lelsinkJ F~and Abstract A language-independent framework for syntac- tic finlte-state parsing is discussed... ART 8 program N NOM SG 8SUBJ @ run V PRES SG3 8FINV 8MAINV 88 Note that in this framework, the ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences


Page:   1  2  3  4  5 
Page:   1  2  3  4  5 
 
61 A New Parallel Algorithm for Generalized LR Parsing Hiroald NUMAZAKI l[ozumi TANAKA
 

Summary:  A New Parallel Algorithm for Generalized LR Parsing Hiroald NUMAZAKI l[ozumi TANAKA Department... Tomita's parsing algorithm [~Ibmita 86], which adapted the LR parsing al- gorithm to context fl... ~ed on Tomita's algorithm [Tanaka 89]. However, there is a problem in that this algorithm syn- chronizes parsing

  

Source: Association for Computational Linguistics (ACL) Anthology; Tokunaga, Takenobu - Department of Computer Science, Tokyo Institute of Technology

 

Collection: Computer Technologies and Information Sciences

 
62 UNIVERSITY OF DURHAM: DESCRIPTION OF THE LOLITA SYSTEM AS USED IN MUC-7
 

Summary:  to overrunning limits, the parse is abandoned. This is implemented by fixing a time- limit on the process... to lexical and semantic information during the rest of morphology, parsing, and semantics. Affix stripping... . Features are used in parsing (described below). Other Features include word class (Noun, ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
63 Probabilistic Parsing of Unrestricted English Text, With a Highly-Detailed Grammar
 

Summary:  in machine parsing; some of its features are designed expressly to facilitate parse prediction. For example... Probabilistic Parsing of Unrestricted English Text, With a Highly-Detailed Grammar Ezra Black... "raw" words, expres~ sions, and the sentence as a whole. The rich/n.formation base used for ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
64 Distributed Memory: A Basis for Chart Parsing Jon M. Slack
 

Summary:  Distributed Memory: A Basis for Chart Parsing Jon M. Slack Human Cognition Research Laboratory Open... systems are explored as a potential basis for non-deterministic parsing mechanisms. The structure... of a distributed chart parsing representation is outlined. Such a representation encodes both immediate- dominance

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
65 Dynamic Strategy Selection in Flexible Parsing Jaime G. Carbonell and Philip J. Hayes
 

Summary:  Dynamic Strategy Selection in Flexible Parsing Jaime G. Carbonell and Philip J. Hayes Carnegie... to general linguistic knowledge) to bear on both grammatical and ungrammatical input. A parsing algorithm... is presented that integrates several different parsing strategies, with case-frame instantiation dominating

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
66 Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010), pages 707715, Beijing, August 2010
 

Summary:  707­715, Beijing, August 2010 Joint Parsing and Translation Yang Liu and Qun Liu Key Laboratory... - guage, usually separate decoding into two steps: parsing and translation. Although this separation makes... by the number of parse trees offered by parser. Alter- natively, we propose to parse and trans- late ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
67 A New Method for Dependent Parsing Trevor Jim and Yitzhak Mandelbaum
 

Summary:  with parses; (2) it must include a mechanism for abandoning a parse; and (3) it must support nonterminals pa... parses and abandoning failed parses. Parameters for nonterminals (3) are very naturally supported by top... A New Method for Dependent ...

  

Source: Fisher, Kathleen - AT&T Labs Research

 

Collection: Computer Technologies and Information Sciences

 
68 Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL 2007, pp. 11391143, Prague, June 2007. c 2007 Association for Computational Linguistics
 

Summary:  -Reduce parsing al- gorithm. Online training facilitates the use of high dimensional features without cre- ating... Parsing Prashanth Reddy Mannem Language Technologies Research Center IIIT-Hyderabad, India prashanth... @research.iiit.ac.in Abstract Deterministic parsing has emerged as an ef- fective ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
69 The Generic Information Extraction System Jerry R. Hobbs
 

Summary:  exponential time to polynomial time . Recently more and more systems are abandoning full-sentence parsing... the parsing module . The parser is the transducer. The input is the sequence of words or lexical items... that constitute the sentence . The output is a parse tree of the sentence . This adds ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
70 Computational Linguistics Volume 25, Number 3 Beyond Grammar: An Experience-based Theory of Language
 

Summary:  the past few years, Rens Bod and other researchers have investigated Data Ori- ented Parsing (DOP... ) approaches to statistical parsing. This book gives theoretical back- ground, algorithms, and evaluation... , they are probably general enough to include all statistical parsing models in the literature. Fortunately

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
71 Computational Linguistics and Chinese Language Processing Vol. 6, No. 1, February 2001, pp. 83-108
 

Summary:  are first aligned in syntactic structure by combining a language parsing with a statistical bilingual... translation template acquisition. Most of the approaches have followed what may be called a "parse-parse... -match" procedure [Wu 1997]. The main idea is that each language of the parallel corpus is first parsed individually

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
72 Efficient Parsing of Highly Ambiguous ContextFree Grammars with Bit Vectors
 

Summary:  ­pass chart parsers create more nodes which are later abandoned. Viterbi parsing involves four steps... Efficient Parsing of Highly Ambiguous Context­Free Grammars with Bit Vectors Helmut Schmid... ­free parsing is presented. The parser computes a compact parse forest representation of ...

  

Source: Möbius, Bernd - Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart

 

Collection: Computer Technologies and Information Sciences

 
73 Eastern Virginia Medical School Current Website Usability Testing Report
 

Summary:  on the site Testing o Situational Analysis Group ­ performed tasks while being questioned by facilitators... Findings Qualitative Internal users frequently abandoned tasks and said they would "just call someone... information Abandoned/2 2 min. 27 sec. Find contact info Abandoned/4 7 ...

  

Source: Dobrian, Anca D. - Department of Physiological Sciences, Eastern Virginia Medical School

 

Collection: Biology and Medicine

 
74 Efficient Parsing of Highly Ambiguous Context-Free Grammars with Bit Vectors
 

Summary:  -pass chart parsers create more nodes which are later abandoned. Viterbi parsing involves four steps... Efficient Parsing of Highly Ambiguous Context-Free Grammars with Bit Vectors Helmut Schmid... -free parsing is presented. The parser computes a compact parse forest representation of the ...

  

Source: Association for Computational Linguistics (ACL) Anthology; Möbius, Bernd - Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart

 

Collection: Computer Technologies and Information Sciences

 
75 TOWARD A LANGUAGE THEORETIC PROOF OF THE FOUR COLOR THEOREM
 

Summary:  with the same number of leaves parses a common word under a certain simple grammar. We enumerate the common... parse words for several infinite families of tree pairs and discuss several ways to reduce the problem... of finding a parse word for a pair of trees to that for a smaller pair. The statement that every pair

  

Source: Zeilberger, Doron - Department of Mathematics, Rutgers University

 

Collection: Mathematics

 
76 MDL-based DCG Induction for NP Identi cation Miles Osborne
 

Summary:  additionally annotated with parsed cor- pora. As a demonstration of the learner, we show how full Noun Phrases... for this decision seems to be pragmatic, driven in part by a lack of technology capable of parsing large quantities... and training with sentences annotated with full sentential parses produce very similar results to ...

  

Source: Osborne, Miles - School of Informatics, University of Edinburgh

 

Collection: Computer Technologies and Information Sciences

 
77 DIMACS Technical Report 9361 August 1993
 

Summary:  : a finite set of pairs of partial parse trees is constructed; if for each pair the two partial parse trees... , they can often be parsed more efficiently due to their having smaller parse trees. In [1... is to reduce the number of productions in large parse trees by roughly a factor of ...

  

Source: Rutgers University, Center for Discrete Mathematics and Theoretical Computer Science

 

Collection: Mathematics ; Computer Technologies and Information Sciences

 
78 Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 968975, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics
 

Summary:  -projective parsing, as a way of capturing non-projective dependencies, and transformations used to facilitate parsing... Transformations for Inductive Dependency Parsing Jens Nilsson Joakim Nivre V¨axj¨o University, School... {jni,nivre,jha}@msi.vxu.se Johan Hall Abstract Previous studies in data-driven ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
79 An Efficient Algorithm to Induce Minimum Average Lookahead Grammars for Incremental LR Parsing
 

Summary:  An Efficient Algorithm to Induce Minimum Average Lookahead Grammars for Incremental LR Parsing... for incremental parsing in NLP and cognitive models. Our thesis is that a suitable learn- ing bias for grammar... of environmental constraints con- firming or rejecting potential parses. The constrain- ing grammar typically

  

Source: Association for Computational Linguistics (ACL) Anthology; Wu, Dekai - Department of Computer Science, Hong Kong University of Science and Technology

 

Collection: Computer Technologies and Information Sciences

 
80 Calculating the Probability of a Partial Parse of a Sentence
 

Summary:  be abandoned; there is no possibility that the parse tree can he completed. Furthermore, the bigger this quan... Calculating the Probability of a Partial Parse of a Sentence bred Kochman and Joseph Kupin Center... in parsing algorithms is Lhe organizaLion o~ branched searches to deal with an~iguous sentences. ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences


Page:   1  2  3  4  5 
Page:   1  2  3  4  5 
 
81 MDL-based DCG Induction for NP Identification Miles Osborne
 

Summary:  additionally annotated with parsed cor- pora. As a demonstration of the learner, we show how full Noun Phrases... for this decision seems to be pragmatic, driven in part by a lack of technology capable of parsing large quantities... annotated with full sentential parses produce very similar results to each other. We stress that ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
82 Incremental Learning of System Log Formats Kathleen Fisher
 

Summary:  . To facilitate working with such log files, we developed PADS[2], a high-level declarative specification language... de- scription, use this description to parse the data, flag segments of the data that do not match... to describe ad hoc data. Each PADS type plays a dual role: it specifies a grammar by which to parse the data

  

Source: Walker, David - Department of Computer Science, Princeton University

 

Collection: Computer Technologies and Information Sciences

 
83 Incremental Learning of System Log Formats [Extended Abstract]
 

Summary:  induction, analysis of system logs, domain-specific lan- guages, parsing, tool generation, ad hoc data, PADS... . To facilitate working with such log files, we developed PADS[2], a high-level declarative specification language... : write a partial description, use this description to parse the data, flag segments of the data that ...

  

Source: Zhu, Kenny Q. - Department of Computer Science, Princeton University

 

Collection: Computer Technologies and Information Sciences

 
84 Automatic Partial Parsing Rule Acquisition Using Decision Tree Induction
 

Summary:  that can facilitate the establishment of unambiguous partial parsing rules. The features used... Automatic Partial Parsing Rule Acquisition Using Decision Tree Induction Myung-Seok Choi, Chul Su... parsing techniques try to recover syntactic informa- tion efficiently and reliably by sacrificing

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
85 Analysis of Unknown Lexical Items using Morphological and Syntactic Information with the TIMIT Corpus
 

Summary:  in the lexicon (referred to as unknown words) is the use of syntactic parsing rules. The distinction between... is performed to investigate the ability of a parser to parse unknown words using morphology and syntactic... parsing rules without human intervention. This experiment shows that the performance of the parser

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
86 TOWARD A LANGUAGE THEORETIC PROOF OF THE FOUR COLOR THEOREM
 

Summary:  with the same number of leaves parses a common word under a certain simple grammar. We enumerate the common... parse words for several infinite families of tree pairs and discuss several ways to reduce the problem... of finding a parse word for a pair of trees to that for a smaller pair. The statement that every pair

  

Source: Rowland, Eric - Department of Mathematics, Tulane University

 

Collection: Mathematics

 
87 TOWARD A LANGUAGE THEORETIC PROOF OF THE FOUR COLOR THEOREM
 

Summary:  with the same number of leaves parses a common word under a certain simple grammar. We enumerate the common... parse words for several infinite families of tree pairs and discuss several ways to reduce the problem... of finding a parse word for a pair of trees to that for a smaller pair. The statement that every pair

  

Source: Rowland, Eric - Department of Mathematics, Tulane University; Zeilberger, Doron - Department of Mathematics, Rutgers University

 

Collection: Mathematics

 
88 Proceedings of the NAACL-HLT 2007 Doctoral Consortium, pages 58, Rochester, April 2007. c 2007 Association for Computational Linguistics
 

Summary:  the training data so that the training algorithm is encouraged to facilitate improved global parsing accuracy... Association for Computational Linguistics Learning Structured Classifiers for Statistical Dependency Parsing... . Then, I incorporate two ideas from probabilistic parsing--word similar- ity ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
89 ACL Lifetime Achievement Award The Right Tools: Reflections on Computation
 

Summary:  simulates the weather, nothing gets wet. But computers really do parse sentences. Natural language question... , lattice theory, first-order logic, and algorithms for parsing, search, optimization, and theorem... his theories. The other was the fact that he would completely abandon a theory and look for a new one

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
90 Proceedings of the 5th International Joint Conference on Natural Language Processing, pages 246254, Chiang Mai, Thailand, November 8 13, 2011. c 2011 AFNLP
 

Summary:  Parse Forests for Parse Selection and Treebanking Andrew MacKinlay , Rebecca Dridan , Dan Flickinger... treebank to constrain a parse forest from an HPSG parser. Combining this with self-training, we show... the GENIA treebank (Yuka et al., 2005), in the context of training an HPSG parse selection model

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
91 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages, pages 103107, Los Angeles, California, June 2010. c 2010 Association for Computational Linguistics
 

Summary:  Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically... Linguistics Easy First Dependency Parsing of Modern Hebrew Yoav Goldberg and Michael Elhadad Ben Gurion... the parsing accuracy, making it on-par with a second-order globally optimized MST parser. The improvement due

  

Source: Association for Computational Linguistics (ACL) Anthology; Elhadad, Michael - Department of Computer Science, Ben-Gurion University

 

Collection: Computer Technologies and Information Sciences

 
92 Michael B. Kac Department of Liuguistics
 

Summary:  to determine what is PROHIBITED. Our approach facilitates the use of information at stages in the parsing... Reconnaissance-Attack Parsing* Tom Rindflesch Dcpm'tment of Linguistics University of Minnesota Minneapolis, MN... wc will describe an approach to parsing one major component of which is a stragegy ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
93 A Practical System for HumanLike Parsing Christian R. Huyck 1
 

Summary:  of the parsing algorithm is simple, but sophisticated processing is facilitated by the grammar selection rules... A Practical System for Human­Like Parsing Christian R. Huyck 1 Abstract. This paper describes... a human­like natural language parser called Plink. It works by parsing left­to­right through a ...

  

Source: Huyck, Chris - School of Computing Science, Middlesex University

 

Collection: Computer Technologies and Information Sciences

 
94 Parsing of Context-Free Languages * Klaas Sikkel
 

Summary:  but a recognizer enhanced with information that facilitates parse tree construction. It is common practice to call... Parsing of Context-Free Languages * Klaas Sikkel GMD- German National Research Center... , anijholt@cs.utwente.nl Abstract Parsing is the process of assigning structure to sentences. The ...

  

Source: Sikkel, Klaas - Department of Computer Science, Universiteit Twente

 

Collection: Computer Technologies and Information Sciences

 
95 Parse Fitting and Prose Fixing: Getting a Hold on III-formedness 1
 

Summary:  Parse Fitting and Prose Fixing: Getting a Hold on III-formedness 1 K. Jensen, G. E. Heidorn, L. A... of fitted parsing. When the rules of a conventional syntactic grammar are unable to produce a parse... for an input string, this technique can be used to produce a reasonable approximate parse that can serve

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
96 ccsd-00091444,version1-6Sep2006 Improving term extraction with terminological
 

Summary:  -syntactic markers [1], chunking based syntactic frontiers and endogenous parsing [2] , and distributional analysis... portability to new domains as it is difficult to define parsing patterns large enough with a good precision... and parsing by using external resources. In addition, we chose to perform positive filtering in the ...

  

Source: Ecole Polytechnique, Centre de mathématiques

 

Collection: Mathematics

 
97 Coling 2008: Proceedings of the workshop on Grammar Engineering Across Frameworks, pages 3340 Manchester, August 2008
 

Summary:  ­40 Manchester, August 2008 Speeding up LFG Parsing Using C-Structure Pruning Aoife Cahill John T. Maxwell III... @uib.no Abstract In this paper we present a method for greatly reducing parse times in LFG pars- ing, while... at the same time maintaining parse accuracy. We evaluate the method- ology on data from English, German

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
98 Deterministic Parsing of Syntactic Non-fluencies Donald Hindle
 

Summary:  Deterministic Parsing of Syntactic Non-fluencies Donald Hindle Bell Laboratories Murray Hill, New... -fluencies that occur in speech. Then, after reviewing the notion of deterministic parsing, I will describe the model... of parsing self-corrections in detail, and report results from a sample of 1500 sentences. Finally, I discuss

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
99 Proceedings of the 22nd International Conference on Computational Linguistics (Coling 2008), pages 753760 Manchester, August 2008
 

Summary:  if the tree constraints are abandoned in their graph-based parsing framework, it is possible to compute more... 753­760 Manchester, August 2008 Shift-Reduce Dependency DAG Parsing Kenji Sagae Institute for Creative... parsing approaches assume that sentence struc- ture is represented as trees. Although ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
100 Shift-Reduce Dependency DAG Parsing Kenji Sagae
 

Summary:  in the sentence). This assumption, of course, has to be abandoned in dependency DAG parsing. McDonald et al. (2006... Shift-Reduce Dependency DAG Parsing Kenji Sagae Institute for Creative Technologies University... for Text Mining tsujii@is.s.u-tokyo.ac.jp Abstract Most data-driven dependency parsing ...

  

Source: Southern California, University of - Institute for Creative Technologies, Graphics Lab

 

Collection: Computer Technologies and Information Sciences


Page:   1  2  3  4  5