Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PARSER")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 964

  • Page / 39

Export

Selection :

  • and

MASCOT HTML and XML parser : An implementation of a novel object model for protein identification dataYANG, Chunguang G; GRANITE, Stephen J; VAN EYK, Jennifer E et al.Proteomics (Weinheim. Print). 2006, Vol 6, Num 21, pp 5688-5693, issn 1615-9853, 6 p.Article

Constituency and Dependency Parsers EvaluationCOMELLES, Elisabet; ARRANZ, Victoria; CASTELLON, Irene et al.Procesamiento del lenguaje natural. 2010, Num 45, pp 59-66, issn 1135-5948, 8 p.Article

A SYNTACTIC ANALYZER ADAPTED TO SPEECH RECOGNITION.QUINTON P.1976; IN: INT. CONF. ACOUST. SPEECH SIGNAL PROCESS. CONF. REC.; PHILADELPHIA, PA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 453-456; BIBL. 5 REF.Conference Paper

ANTLR : a predicated-LL(k) Parser generatorPARR, T. J; QUONG, R. W.Software, practice & experience. 1995, Vol 25, Num 7, pp 789-810, issn 0038-0644Article

PREDICTION CONTROL PARSER: EXTENDED LINGOLTANAKA H; SATO T; MOTOYOSHI F et al.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 2; PP. 868-870; BIBL. 6 REF.Conference Paper

States merging in LR parserDILLIP KUMAR LENKA; KUMAR, Pawan.ACM SIGPLAN notices. 2006, Vol 41, Num 4, pp 24-29, issn 1523-2867, 6 p.Article

Disambiguation filters for scannerless generalized LR parsersVAN DEN BRAND, M. G. J; SCHEERDER, J; VINJU, J. J et al.Report - Software engineering. 2001, Num 25, pp 1-14, issn 1386-369XArticle

Corrección no Supervisada de Dependencias Sintácticas de Aposición mediante Clases Semánticas = Unsupervised Correction of Syntactic Dependencies of Apposition through Semantic ClassesCABALEIRO, Bernardo; PENAS, Anselmo.Procesamiento del lenguaje natural. 2013, Num 51, pp 67-74, issn 1135-5948, 8 p.Article

Experiments with an ensemble of Spanish dependency parsersMORANTE VALLEIO, Roser.Procesamiento del lenguaje natural. 2008, Num 40, pp 59-66, issn 1135-5948, 8 p.Article

A practical method for LR and LL syntactic error diagnosis and recoveryBURKE, M. G; FISHER, G. A.ACM transactions on programming languages and systems. 1987, Vol 9, Num 2, pp 164-197, issn 0164-0925Article

AN EXPERIMENT WITH THE BOYER-MOORE THEOREM PROVER: A PROOF OF THE CORRECTNESS OF A SIMPLE PARSER OF EXPRESSIONSGLOESS PY.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 154-169; BIBL. 12 REF.Conference Paper

ALTERNATIVE PARSERS FOR CONCEPTUAL DEPENDENCY: GETTING THERE IS HALF THE FUNEISENSTADT M.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 238-240; BIBL. 7 REF.Conference Paper

COMPLETE OPERATOR PRECEDENCE CONDITIONS.WILLIAMS MH.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 2; PP. 60-62; BIBL. 4 REF.Article

Lower bounds on the size of deterministic parsersUKKONEN, E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 153-170, issn 0022-0000Article

The Edge-Pushing LR(k) AlgorithmCHEN, X; PAGER, D.Software engineering research & preactice. International conferenceWorldComp'2011. 2011, pp 471-477, isbn 1-60132-199-6 1-60132-200-3 1-60132-201-1, 7 p.Conference Paper

Parsing non-LR(k) grammars with YaccMERRILL, G. H.Software, practice & experience. 1993, Vol 23, Num 8, pp 829-850, issn 0038-0644Article

On the reduction of LR(k) parsersWOO-JUN PARK; MYUNG-JOON LEE; KWANG-MOO CHOE et al.Information processing letters. 1993, Vol 47, Num 5, pp 245-251, issn 0020-0190Article

QUELQUES QUESTIONS THEORIQUES D'ANALYSE SYNTAXIQUE PARALLELEBABICHEV AV.1982; KIBERNETIKA; UKR; DA. 1982; NO 2; PP. 40-44; ABS. ENG; BIBL. 7 REF.Article

ANALYSEUR SYNTAXIQUE IMPLANTE, UTILISANT UNE MEMOIRE ASSOCIATIVE POUR LA RECONNAISSANCE DES CONSTRUCTIONS D'UN LANGAGEASRATYAN R EH; LYSIKOV VT.1978; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1978; NO 5; PP. 162-169; ABS. ANGL.; BIBL. 7 REF.Article

CHARACTERISTIC PARSING: A FRAMEWORK FOR PRODUCING COMPACT DETERMINISTIC PARSERS. I.GELLER MM; HARRISON MA.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 3; PP. 265-317; BIBL. 18 REF.Article

Compact recursive-descent parsing of expressionsHANSON, D. R.Software, practice & experience. 1985, Vol 15, Num 12, pp 1205-1212, issn 0038-0644Article

How to parse gaps in spoken utterancesGOERZ, G; BECKSTEIN, C.Association for computational linguistics. European chapter. Conference. 1. 1983, pp 111-113Conference Paper

Natural language input for scene generationADORNI, G; DI MANZO, M; FERRARI, G et al.Association for computational linguistics. European chapter. Conference. 1. 1983, pp 175-182Conference Paper

Extended access to the left context in an ATN ParserPRODANO, I; FERRARI, G.Association for computational linguistics. European chapter. Conference. 1. 1983, pp 58-65Conference Paper

ELIMINACJA REDUKCJI LANCUCHOWYCH W PARSERACH PRECEDENSYJNYCH = ELIMINATION DES REDUCTIONS DE CHAINE D'ANALYSEURS SYNTAXIQUESKROL J; LEMBAS J.1982; PODSTAWY STEROWANIA; ISSN 0374-4094; POL; DA. 1982; VOL. 12; NO 1-2; PP. 71-80; ABS. ENG/RUS; BIBL. 7 REF.Article

  • Page / 39