Displaying 1 to 1 from 1 results

java-probabilistic-earley-parser - 🎲 Efficient Java implementation of the probabilistic Earley algorithm to parse Stochastic Context Free Grammars (SCFGs)

  •    Java

This is a library for parsing a sequence of tokens (like words) into tree structures, along with the probability that the particular sequence generates that tree structure. This is mainly useful for linguistic purposes, such as morphological parsing, speech recognition and generally information extraction. It also finds applications in computational biology. This library allows you to do these things efficiently, as long as you can describe the rules as a Context-free Grammar (CFG).