On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
A new analysis of LALR formalisms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Early error detection in syntax-driven parsers
IBM Journal of Research and Development
A linear algorithm for finding dominators in flow graphs and related problems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A survey of three dialogue models
ACM Transactions on Graphics (TOG)
An efficient augmented-context-free parsing algorithm
Computational Linguistics
A short proof of a conjecture of De Remer and Pennello
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of Concurrent Control Flow in Distributed Computer Systems
IEEE Transactions on Software Engineering
Object-oriented development of integrated programming environments with ASDL
SIGSMALL '88 Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES
The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parsing with flexibility, dynamic strategies, and idioms in mind
Computational Linguistics
Syntactic graphs: a representation for the union of all ambiguous parse trees
Computational Linguistics
G-base fourth normal form in relational database
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Production trees: a compact representation of parsed programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Estimating the Speedup in Parallel Parsing
IEEE Transactions on Software Engineering
On Kilbury's modification of Earley's algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient construction of LR(k) states and tables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Recognition and Parsing on the Hypercube
IEEE Transactions on Computers
An improved storage management scheme for block structured languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computation of Probabilities for an Island-Driven Parser
IEEE Transactions on Pattern Analysis and Machine Intelligence
Complete formal model for information retrieval systems
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
Language Design for Program Manipulation
IEEE Transactions on Software Engineering
Generation of Interactive Parsers with Error Handling
IEEE Transactions on Software Engineering
Recognizing substrings of LR(k) languages in linear time
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed computing with APL
APL '92 Proceedings of the international conference on APL
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Extending the two-partner shared variable protocol to n partners
APL '93 Proceedings of the international conference on APL
A model for studying ambiguity in SGML element declarations
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
An efficient natural language processing system specially designed for the Chinese language
Computational Linguistics
Recognizing substrings of LR(k) languages in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars
IEEE Transactions on Pattern Analysis and Machine Intelligence
From text to hypertext by indexing
ACM Transactions on Information Systems (TOIS)
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Efficient incremental LR parsing for syntax-directed editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the third ACM international conference on Multimedia
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
IEEE Transactions on Software Engineering
Combining CFG and recursive functions to get a new language
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
A transformational grammar-based query processor for access control in a planning system
ACM Transactions on Database Systems (TODS)
A portable syntactic error recovery scheme for LR(1) parsers
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Augmenting Parsers to Support Incrementality
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
A Generalization of Ogden's Lemma
Journal of the ACM (JACM)
Upper Bounds for Speedup in Parallel Parsing
Journal of the ACM (JACM)
On the Decidability of Grammar Problems
Journal of the ACM (JACM)
An Iteration Theorem for Simple Precedence Languages
Journal of the ACM (JACM)
CSC '87 Proceedings of the 15th annual conference on Computer Science
Production probability estimators for context-free grammars
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Recognition of Visual Activities and Interactions by Stochastic Parsing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Korean text summarization using an aggregate similarity
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
ACM Computing Surveys (CSUR)
Perspectives in Software Engineering
ACM Computing Surveys (CSUR)
Probabilistic Languages: A Review and Some Open Questions
ACM Computing Surveys (CSUR)
Tabulation Techniques for Recursive Programs
ACM Computing Surveys (CSUR)
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
On Parsing and Compiling Arithmetic Expressions on Vector Computers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handling Operator Precedence in Arithmetic Expressions with Tree Transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inessential Error Entries and Their Use in LR Parser Optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Computation of LALR(1) Look-Ahead Sets
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
The storage requirement in precedence parsing
Communications of the ACM
A simple recovery-only procedure for simple precedence parsers
Communications of the ACM
Regular right part grammars and their parsers
Communications of the ACM
A syntactic algorithm for peak detection in waveforms with applications to cardiography
Communications of the ACM
Deterministic parsing of ambiguous grammars
Communications of the ACM
The equivalence of reducing transition languages and deterministic languages
Communications of the ACM
Practical syntactic error recovery
Communications of the ACM
Backtrack programming techniques
Communications of the ACM
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
On the complexity of LR(k) testing
Communications of the ACM
On computational properties of chains of recurrences
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Code migration and program maintainability---a categorical perspective
Information Processing Letters
Computing a context-free grammar-generating series
Information and Computation
Strongly non-circular attribute grammars and their recursive evaluation
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
The design of a parser generator
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
Techniques for the construction of small and fast lexical analyzers
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
Systematically derived instruction sets for high-level language support
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Normal form algorithms for extended context-free grammars
Theoretical Computer Science
Theoretical Computer Science
On parsing and condensing substrings of LR languages in linear time
Theoretical Computer Science
A forward move algorithm for LR error recovery
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Strict deterministic versus LR(0) parsing
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Applications of a graph grammar for program control flow analysis
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the covering of left recursive grammars
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An efficient insertion-only error-corrector for LL(1) parsers
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic evaluation and the global value graph
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized left corner parsing
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Elimination of single productions from LR parsers in conjunction with the use of default reductions
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Application of lattice algebra to loop optimization
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Node listings applied to data flow analysis
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A fast and usually linear algorithm for global flow analysis
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the complexity of LR(k) testing
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The line drawing editor, an experiment in computer vision
SIGGRAPH '76 Proceedings of the 3rd annual conference on Computer graphics and interactive techniques
Efficient algorithms for structural similarity of grammars
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Yet another meta-language for programming language processing
ACM SIGPLAN Notices
Packrat parsing:: simple, powerful, lazy, linear time, functional pearl
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Designing reactive systems: integration of abstraction techniques into a synthesis procedure
Journal of Systems and Software - Special issue on artificial and computational intelligence for decisions, control, and automation in engineering and industrial applications
Towards automating of document structure transformations
Proceedings of the 2002 ACM symposium on Document engineering
Repairing syntax errors in LR parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using DEVS Formalism to operationalize ELP Models for diagnosis in SACHEM
Transactions of the Society for Computer Simulation International - Recent advances in DEVS Methodology--part I
Developing Integrated Environments with ASDL
IEEE Software
Capture, Integration, and Analysis of Digital System Requirements with Conceptual Graphs
IEEE Transactions on Knowledge and Data Engineering
interactions - Winds of change
From relational program dependencies to hypertextual access structures
Nordic Journal of Computing
The combinatory morphemic lexicon
Computational Linguistics
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Peircean Ontology of Language
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
A Statistical-Estimation Method for Stochastic Finite-State Transducers Based on Entropy Measures
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Recognition of Abstract Regions in Cartographic Maps
COSIT 2001 Proceedings of the International Conference on Spatial Information Theory: Foundations of Geographic Information Science
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
On Parsing and Condensing Substrings of LR Languages in Linear Time
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Extended Context-Free Grammars and Normal Form Algorithms
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Block-Deterministic Regular Languages
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Automatic test selection based on CEFSM specifications
Acta Cybernetica
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
On the complexity of a problem on monadic string rewriting systems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
LR(k) Testing is Average Case Complete
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Implementation of an interpreter for abstract equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A less dynamic memory allocation scheme for algol-like languages
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
APL two by two-syntax analysis by pairwise reduction
APL '84 Proceedings of the international conference on APL
Research on synthesis of concurrent computing systems (Extended Abstract)
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
The Piecewise Data Flow architecture control flow and register management
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
An algebra for data flow anomaly detection
ICSE '84 Proceedings of the 7th international conference on Software engineering
Contrasting translation, verification and synthesis in software and firmware engineering
MICRO 14 Proceedings of the 14th annual workshop on Microprogramming
LALR(k) testing is PSPACE-complete
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
BIGMAC II: A FORTRAN language augmentation tool
ICSE '81 Proceedings of the 5th international conference on Software engineering
ORACLE a tool for learning compiler writing
SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
Separating tape bounded auxiliary pushdown automata classes
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On line context free language recognition in less than cubic time(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On the complexity of grammar and related problems
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Some restrictions on W-grammars
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A new grammatical transformation into LL(k) form (Extended Abstract)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A partial solution to the reachability-problem for vector-addition systems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Context-free error analysis by evaluation of algebraic power series
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Computer Science And Recursion Theory
ACM '78 Proceedings of the 1978 annual conference
Parallel Compilation In A Multiprocessor Environment (Extended Abstract)
ACM '78 Proceedings of the 1978 annual conference
A Family Of Pass-Oriented Attribute Grammar Evaluators
ACM '78 Proceedings of the 1978 annual conference
Models for specification and anaysis of parallel computing systems
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
Selection processes and their relation to automata
ACM '73 Proceedings of the ACM annual conference
The design of a language-directed editor for block-structured languages
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Applications of feedback in functional programming
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
The use of transition matrices in a recursive-descent compiler
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Global context recovery: A new strategy for parser recovery from syntax errors
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Efficient computation of LALR(1) look-ahead sets
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Program control via transition matrices—a novel application of micro-programming
SIGMINI '76 Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment
Global data flow analysis by decomposition into primes
ICSE '82 Proceedings of the 6th international conference on Software engineering
A flexible semantic analyzer for Ada
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
Ada as a software transition tool
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
Design of instruction set architectures for support of high-level languages
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
The SAGA project: A system for software development
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Logical correctness by construction
DAC '82 Proceedings of the 19th Design Automation Conference
A brief account: Implementation and applications of a Pascal program verifier (Position Statement)
ACM '78 Proceedings of the 1978 annual conference - Volume 2
The influence of productions on derivations and parsing (Extended Abstract)
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Rivalling multiprocessor organization: a hardware/speed trade-off
ACM SIGARCH Computer Architecture News
A flexible semantic analyzer for Ada
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
FEA: a formal English subset for Algebra/Assertions
ACM SIGPLAN Notices
A finite state approach to operator classification
ACM SIGPLAN Notices
Software confederations: an architecture for global systems and global management
Managing globally with information technology
Parsing expression grammars: a recognition-based syntactic foundation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The portable computer in the classroom
ACM SIGCUE Outlook
A characterization of Thompson digraphs
Discrete Applied Mathematics
Crossroads
On the mathematical properties of linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Techniques for automatic memoization with applications to context-free parsing
Computational Linguistics
Learning dependency translation models as collections of finite-state head transducers
Computational Linguistics - Special issue on finite-state methods in NLP
A parsing algorithm that extends phrases
Computational Linguistics
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
Computational Linguistics
PCFG models of linguistic tree representations
Computational Linguistics
Critical tokenization and its properties
Computational Linguistics
Computational Linguistics
Completeness conditions for mixed strategy bidirectional parsing
Computational Linguistics
Problems in natural-language interface to DBMS with examples from EUFID
ANLC '83 Proceedings of the first conference on Applied natural language processing
Evaluation of a parallel chart parser
ANLC '88 Proceedings of the second conference on Applied natural language processing
An efficient chart-based algorithm for partial-parsing of unrestricted texts
ANLC '92 Proceedings of the third conference on Applied natural language processing
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
JPSG parser on constraint logic programming
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Deterministic parsing and unbounded dependencies
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A comparison of rule-invocation strategies in context-free chart parsing
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Finite state processing of tone systems
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Non-deterministic recursive ascent parsing
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
The recognition capacity of local syntactic constraints
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Meta-rules as a basis for processing ill-formed input
Computational Linguistics - Special issue on ill-formed input
Extended access to the left context in an ATN parser
EACL '83 Proceedings of the first conference on European chapter of the Association for Computational Linguistics
Bounded context parsing and easy learnability
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
LR parsers for natural languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Machine translation with a stochastic grammatical channel
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Finite-state approximation of constraint-based grammars using left-corner grammar transforms
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
An attribute-grammar implementation of Government-binding theory
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
On the mathematical properties of linguistic theories
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Syntactic constraints and efficient parsability
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Constraint projection: an efficient treatment of disjunctive feature descriptions
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Transforming syntactic graphs into semantic graphs
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Bottom-up parsing extending context-freeness in a Process Grammar processor
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Synchronous models of language
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Recognition of linear context-free rewriting systems
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
An LR category-neutral parser with left corner prediction
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Bounded-connect noncanonical discriminating-reverse parsers
Theoretical Computer Science - Implementation and application automata
Optimization of html automatically generated by wysiwyg programs
Proceedings of the 13th international conference on World Wide Web
Efficient computation of LALR(1) look-ahead sets
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Modular decomposition of Ada into a hierarchy of sublanguages
ACM SIGAda Ada Letters
A syntax parser based on the case dependency grammar and its efficiency
COLING '80 Proceedings of the 8th conference on Computational linguistics
Compact non-left-recursive grammars using the selective left-corner transform and factoring
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
A constraint-based approach to linguistic performance
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A syntactic and morphological analyzer for a text-to-speech system
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Syllable-based phonetic transcription by maximum likelihood methods
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A user friendly ATN Programming Environment (APE)
COLING '86 Proceedings of the 11th coference on Computational linguistics
Another stride towards knowledge-based machine translation
COLING '86 Proceedings of the 11th coference on Computational linguistics
Parsing with Category Coocurrence Restrictions
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A process-activation based parsing algorithm for the development of Natural Language Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Parsing with look-ahead in real-time on-line translation system
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Composition of translation schemes with D-trees
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Dynamics, dependency grammar and incremental interpretation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Bottom-Up Filtering: a parsing strategy for GPSG
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
The complexity of parsing with extended categorial grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
A new parallel algorithm for generalized LR parsing
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
A Church-Rosser theorem for graph grammars
ACM SIGACT News
Constructing a finite automaton for a given regular expression
ACM SIGACT News
On non-hierachical systems of binary operators
ACM SIGACT News
The language intersection problem for non-recursive context-free grammars
Information and Computation
Supervised learning for the legacy document conversion
Proceedings of the 2004 ACM symposium on Document engineering
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Dominance analysis of irreducible CFGs by reduction
ACM SIGPLAN Notices
Grammatical Inference in Bioinformatics
IEEE Transactions on Pattern Analysis and Machine Intelligence
WISICT '05 Proceedings of the 4th international symposium on Information and communication technologies
Toward an engineering discipline for grammarware
ACM Transactions on Software Engineering and Methodology (TOSEM)
Rhetorical parsing with underspecification and forests
NAACL-Short '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: companion volume of the Proceedings of HLT-NAACL 2003--short papers - Volume 2
Exploiting a sensed environment to improve human-agent communication
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
On the usefulness of deterministic grammars for simulation languages
ACM SIGSIM Simulation Digest
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
A General Technique to Train Language Models on Language Models
Computational Linguistics
Approximating context-free by rational transduction for example-based MT
DMMT '01 Proceedings of the workshop on Data-driven methods in machine translation - Volume 14
A fast algorithm for finding common multiple-vertex dominators in circuit graphs
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Improved Boolean function hashing based on multiple-vertex dominators
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Theoretical Computer Science - Mathematical foundations of computer science 2004
Development in parsing technology: from theory to application
New developments in parsing technology
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient reversal of the intraprocedural flow of control in adjoint computations
Journal of Systems and Software - Special issue: Selected papers from the 4th source code analysis and manipulation (SCAM 2004) workshop
Program control via transition matrices: a novel application of micro-programming
ACM SIGMICRO Newsletter
FSA: an efficient and flexible C++ toolkit for finite state automata using on-demand computation
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Probabilistic parsing strategies
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Some computational complexity results for synchronous context-free grammars
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Synchronous binarization for machine translation
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Learning for semantic parsing with statistical machine translation
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Elements of a spoken language programming interface for robots
Proceedings of the ACM/IEEE international conference on Human-robot interaction
Goodness criteria for programming language grammar rules
ACM SIGPLAN Notices
Stochastic Syntactic Decoding for Pattern Classification
IEEE Transactions on Computers
Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns
IEEE Transactions on Computers
Towards Machine Learning of Grammars and Compilers of Programming Languages
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Using information flow to analyze grammars
Journal of Computing Sciences in Colleges
Analyzing ambiguity of context-free grammars
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A tabular method for island-driven context-free grammar parsing
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Computation of upper-bounds for stochastic context-free languages
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Steps toward next generation computer based systems
ECBS'99 Proceedings of the 1999 IEEE conference on Engineering of computer-based systems
An heuristic-based context-free parsing algorithm
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II
Equational tree transformations
Theoretical Computer Science
Tangent-Linear models by augmented LL-Parsers
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Shift-Resolve parsing: simple, unbounded lookahead, linear time
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Processing of information structure and floating quantifiers in japanese
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
Modelling parametric contracts and the state space of composite components by graph grammars
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Some Aspects of Parsing Expression Grammar
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On Entropy and Optimal Coding Cost for Stochastic Language
Fundamenta Informaticae
| Hi-index | 0.19 |