A general weighted grammar library

Cyril Allauzen, Mehryar Mohri, Brian Roark

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions. We describe several algorithms and utilities of this library and point out in each case their application to several text and speech processing tasks.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
EditorsM. Domaratzki, A. Okhotin, K. Salomaa, S. Yu
Pages23-34
Number of pages12
Volume3317
StatePublished - 2005
Event9th International Conference on Implementation and Application of Automata, CIAA 2004 - Kingston, Canada
Duration: Jul 22 2004Jul 24 2004

Other

Other9th International Conference on Implementation and Application of Automata, CIAA 2004
CountryCanada
CityKingston
Period7/22/047/24/04

Fingerprint

Text processing
Speech processing
Processing

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Allauzen, C., Mohri, M., & Roark, B. (2005). A general weighted grammar library. In M. Domaratzki, A. Okhotin, K. Salomaa, & S. Yu (Eds.), Lecture Notes in Computer Science (Vol. 3317, pp. 23-34)

A general weighted grammar library. / Allauzen, Cyril; Mohri, Mehryar; Roark, Brian.

Lecture Notes in Computer Science. ed. / M. Domaratzki; A. Okhotin; K. Salomaa; S. Yu. Vol. 3317 2005. p. 23-34.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Allauzen, C, Mohri, M & Roark, B 2005, A general weighted grammar library. in M Domaratzki, A Okhotin, K Salomaa & S Yu (eds), Lecture Notes in Computer Science. vol. 3317, pp. 23-34, 9th International Conference on Implementation and Application of Automata, CIAA 2004, Kingston, Canada, 7/22/04.
Allauzen C, Mohri M, Roark B. A general weighted grammar library. In Domaratzki M, Okhotin A, Salomaa K, Yu S, editors, Lecture Notes in Computer Science. Vol. 3317. 2005. p. 23-34
Allauzen, Cyril ; Mohri, Mehryar ; Roark, Brian. / A general weighted grammar library. Lecture Notes in Computer Science. editor / M. Domaratzki ; A. Okhotin ; K. Salomaa ; S. Yu. Vol. 3317 2005. pp. 23-34
@inproceedings{7c698ebe615d47a7a5f605122ef7bf3a,
title = "A general weighted grammar library",
abstract = "We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions. We describe several algorithms and utilities of this library and point out in each case their application to several text and speech processing tasks.",
author = "Cyril Allauzen and Mehryar Mohri and Brian Roark",
year = "2005",
language = "English (US)",
volume = "3317",
pages = "23--34",
editor = "M. Domaratzki and A. Okhotin and K. Salomaa and S. Yu",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - A general weighted grammar library

AU - Allauzen, Cyril

AU - Mohri, Mehryar

AU - Roark, Brian

PY - 2005

Y1 - 2005

N2 - We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions. We describe several algorithms and utilities of this library and point out in each case their application to several text and speech processing tasks.

AB - We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions. We describe several algorithms and utilities of this library and point out in each case their application to several text and speech processing tasks.

UR - http://www.scopus.com/inward/record.url?scp=23944496571&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23944496571&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:23944496571

VL - 3317

SP - 23

EP - 34

BT - Lecture Notes in Computer Science

A2 - Domaratzki, M.

A2 - Okhotin, A.

A2 - Salomaa, K.

A2 - Yu, S.

ER -