GraphPatternCompiler

Instance Constructors

new GraphPatternCompiler(unit: String, config: OdinConfig)

Type Members

type Elem = Char

Definition Classes
RegexParsers → Parsers
case class Error extends NoSuccess with Product with Serializable

Definition Classes
Parsers
case class Failure extends NoSuccess with Product with Serializable

Definition Classes
Parsers
type Input = Reader[Elem]

Definition Classes
Parsers
sealed abstract class NoSuccess extends ParseResult[Nothing]

Definition Classes
Parsers
trait OnceParser[+T] extends Parser[T]

Definition Classes
Parsers
sealed abstract class ParseResult[+T] extends AnyRef

Definition Classes
Parsers
abstract class Parser[+T] extends (Input) ⇒ ParseResult[T]

Definition Classes
Parsers
case class Success[+T] extends ParseResult[T] with Product with Serializable

Definition Classes
Parsers
case class ~[+a, +b] extends Product with Serializable

Definition Classes
Parsers

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def OnceParser[T](f: (Input) ⇒ ParseResult[T]): Parser[T] with OnceParser[T]

Definition Classes
Parsers
def Parser[T](f: (Input) ⇒ ParseResult[T]): Parser[T]

Definition Classes
Parsers
def accept[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

Definition Classes
Parsers
def accept[ES](es: ES)(implicit arg0: (ES) ⇒ List[Elem]): Parser[List[Elem]]

Definition Classes
Parsers
implicit def accept(e: Elem): Parser[Elem]

Definition Classes
Parsers
def acceptIf(p: (Elem) ⇒ Boolean)(err: (Elem) ⇒ String): Parser[Elem]

Definition Classes
Parsers
def acceptMatch[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

Definition Classes
Parsers
def acceptSeq[ES](es: ES)(implicit arg0: (ES) ⇒ Iterable[Elem]): Parser[List[Elem]]

Definition Classes
Parsers
def argPattern: Parser[ArgumentPattern]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def assertionPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def atomicConstraint: Parser[TokenConstraint]

Definition Classes
TokenConstraintParsers
def atomicExpression: Parser[NumericExpression]

Definition Classes
TokenConstraintParsers
def atomicGraphPattern: Parser[GraphPatternNode]
def atomicPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def atomicPatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def capturePattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def capturePatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def chainl1[T, U](first: ⇒ Parser[T], p: ⇒ Parser[U], q: ⇒ Parser[(T, U) ⇒ T]): Parser[T]

Definition Classes
Parsers
def chainl1[T](p: ⇒ Parser[T], q: ⇒ Parser[(T, T) ⇒ T]): Parser[T]

Definition Classes
Parsers
def chainr1[T, U](p: ⇒ Parser[T], q: ⇒ Parser[(T, U) ⇒ U], combine: (T, U) ⇒ U, first: U): Parser[U]

Definition Classes
Parsers
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def commit[T](p: ⇒ Parser[T]): Parser[T]

Definition Classes
Parsers
def compareOps: Parser[String]

Definition Classes
TokenConstraintParsers
def compileGraphPattern(input: String): GraphPattern
def compileTokenPattern(input: String): TokenPattern

Definition Classes
TokenPatternParsers
def concatGraphPattern: Parser[GraphPatternNode]
def concatPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def concatPatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
val config: OdinConfig

Definition Classes
TokenPatternParsers → TokenConstraintParsers
def conjunctiveConstraint: Parser[TokenConstraint]

Definition Classes
TokenConstraintParsers
def dependencyPattern: Parser[GraphPattern]
def disjunctiveConstraint: Parser[TokenConstraint]

Definition Classes
TokenConstraintParsers
def disjunctiveGraphPattern: Parser[GraphPatternNode]
def elem(e: Elem): Parser[Elem]

Definition Classes
Parsers
def elem(kind: String, p: (Elem) ⇒ Boolean): Parser[Elem]

Definition Classes
Parsers
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def err(msg: String): Parser[Nothing]

Definition Classes
Parsers
def exactPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def exactPatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def exactStringMatcher: Parser[ExactStringMatcher]

Definition Classes
StringMatcherParsers
def failure(msg: String): Parser[Nothing]

Definition Classes
Parsers
def fieldConstraint: Parser[TokenConstraint]

Definition Classes
TokenConstraintParsers
def filterGraphPattern: Parser[GraphPatternNode]

token constraint
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def guard[T](p: ⇒ Parser[T]): Parser[T]

Definition Classes
Parsers
def handleWhiteSpace(source: CharSequence, offset: Int): Int

Attributes
protected
Definition Classes
RegexParsers
def hashCode(): Int

Definition Classes
AnyRef → Any
def identifier: Parser[String]

Definition Classes
StringMatcherParsers
def incomingMatcher: Parser[GraphPatternNode]
def incomingPattern: Parser[GraphPatternNode]
def incomingWildcard: Parser[GraphPatternNode]
def int: Parser[Int]

Definition Classes
TokenPatternParsers
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
implicit def literal(s: String): Parser[String]

Definition Classes
RegexParsers
def log[T](p: ⇒ Parser[T])(name: String): Parser[T]

Definition Classes
Parsers
def lookaheadAssertion: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def lookaroundGraphPattern: Parser[GraphPatternNode]
def lookbehindAssertion: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def mentionPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def mkCompare(lhs: NumericExpression, op: String, rhs: NumericExpression): TokenConstraint

Definition Classes
TokenConstraintParsers
def mkList[T]: (~[T, List[T]]) ⇒ List[T]

Definition Classes
Parsers
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def negatedConstraint: Parser[TokenConstraint]

Definition Classes
TokenConstraintParsers
def not[T](p: ⇒ Parser[T]): Parser[Unit]

Definition Classes
Parsers
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def numberConstant: Parser[NumericExpression]

Definition Classes
TokenConstraintParsers
def numberLiteral: Parser[Double]

Definition Classes
TokenConstraintParsers
def numericConstraint: Parser[TokenConstraint]

Definition Classes
TokenConstraintParsers
def numericExpression: Parser[NumericExpression]

for numerical comparisons
for numerical comparisons

Definition Classes
TokenConstraintParsers
def numericFunction: Parser[NumericExpression]

update as needed.
update as needed. Currently only a distributional similarity comparison

Definition Classes
TokenConstraintParsers
def opt[T](p: ⇒ Parser[T]): Parser[Option[T]]

Definition Classes
Parsers
def outgoingMatcher: Parser[GraphPatternNode]
def outgoingPattern: Parser[GraphPatternNode]
def outgoingWildcard: Parser[GraphPatternNode]
def parse[T](p: Parser[T], in: Reader): ParseResult[T]

Definition Classes
RegexParsers
def parse[T](p: Parser[T], in: CharSequence): ParseResult[T]

Definition Classes
RegexParsers
def parse[T](p: Parser[T], in: Reader[Char]): ParseResult[T]

Definition Classes
RegexParsers
def parseAll[T](p: Parser[T], in: CharSequence): ParseResult[T]

Definition Classes
RegexParsers
def parseAll[T](p: Parser[T], in: Reader): ParseResult[T]

Definition Classes
RegexParsers
def parseAll[T](p: Parser[T], in: Reader[Char]): ParseResult[T]

Definition Classes
RegexParsers
def phrase[T](p: Parser[T]): Parser[T]

Definition Classes
RegexParsers → Parsers
def positioned[T <: Positional](p: ⇒ Parser[T]): Parser[T]

Definition Classes
RegexParsers → Parsers
def productExpression: Parser[NumericExpression]

Definition Classes
TokenConstraintParsers
def quantifiedGraphPattern: Parser[GraphPatternNode]
def quantifiedPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def quantifiedPatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def quotedStringLiteral: Parser[String]

Definition Classes
StringMatcherParsers
def rangeGraphPattern: Parser[GraphPatternNode]
def rangePattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def rangePatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
implicit def regex(r: Regex): Parser[String]

Definition Classes
RegexParsers
def regexLiteral: Parser[Regex]

Definition Classes
StringMatcherParsers
def regexStringMatcher: Parser[RegexStringMatcher]

Definition Classes
StringMatcherParsers
def rep[T](p: ⇒ Parser[T]): Parser[List[T]]

Definition Classes
Parsers
def rep1[T](first: ⇒ Parser[T], p0: ⇒ Parser[T]): Parser[List[T]]

Definition Classes
Parsers
Annotations
@migration
Migration
(Changed in version 2.9.0) The p0 call-by-name arguments is evaluated at most once per constructed Parser object, instead of on every need that arises during parsing.
def rep1[T](p: ⇒ Parser[T]): Parser[List[T]]

Definition Classes
Parsers
def rep1sep[T](p: ⇒ Parser[T], q: ⇒ Parser[Any]): Parser[List[T]]

Definition Classes
Parsers
def repN[T](num: Int, p: ⇒ Parser[T]): Parser[List[T]]

Definition Classes
Parsers
def repeatGraphPattern: Parser[GraphPatternNode]
def repeatedPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def repeatedPatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def repsep[T](p: ⇒ Parser[T], q: ⇒ Parser[Any]): Parser[List[T]]

Definition Classes
Parsers
val resources: OdinResourceManager

access to resources (w2v embeddings, wordnet, etc)
access to resources (w2v embeddings, wordnet, etc)

Definition Classes
TokenConstraintParsers
def sentenceAssertion: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def simScore: Parser[NumericExpression]

ex.
ex. get the distributional similarity score (dot product of L2 normed vectors) for a specified word and the current token

Definition Classes
TokenConstraintParsers
def singleTokenPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def skipWhitespace: Boolean

Definition Classes
RegexParsers
def splitPattern: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def splitPatternRev: Parser[ProgramFragment]

Definition Classes
TokenPatternParsers
def stepGraphPattern: Parser[GraphPatternNode]
def stringLiteral: Parser[String]

Definition Classes
StringMatcherParsers
def stringMatcher: Parser[StringMatcher]

Definition Classes
StringMatcherParsers
def success[T](v: T): Parser[T]

Definition Classes
Parsers
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def termExpression: Parser[NumericExpression]

Definition Classes
TokenConstraintParsers
def toString(): String

Definition Classes
AnyRef → Any
def tokenConstraint: Parser[TokenConstraint]

Definition Classes
TokenConstraintParsers
def tokenPattern: Parser[TokenPattern]

Definition Classes
TokenPatternParsers
def traversalGraphPattern: Parser[GraphPatternNode]

any pattern that represents graph traversal
def triggerMentionGraphPattern: Parser[GraphPattern]
def triggerPatternGraphPattern: Parser[GraphPattern]
val unit: String

the field that should be used by unitConstraint
the field that should be used by unitConstraint

Definition Classes
TokenPatternParsers → TokenConstraintParsers
def unitConstraint: Parser[TokenConstraint]

makes a token constraint from a single string matcher
makes a token constraint from a single string matcher

Definition Classes
TokenConstraintParsers
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
val whiteSpace: Regex

Definition Classes
TokenPatternParsers → RegexParsers

Related Doc: package impl

class GraphPatternCompiler extends TokenPatternParsers

Instance Constructors

new GraphPatternCompiler(unit: String, config: OdinConfig)

Type Members

type Elem = Char

case class Error extends NoSuccess with Product with Serializable

case class Failure extends NoSuccess with Product with Serializable

type Input = Reader[Elem]

sealed abstract class NoSuccess extends ParseResult[Nothing]

trait OnceParser[+T] extends Parser[T]

sealed abstract class ParseResult[+T] extends AnyRef

abstract class Parser[+T] extends (Input) ⇒ ParseResult[T]

case class Success[+T] extends ParseResult[T] with Product with Serializable

case class ~[+a, +b] extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def OnceParser[T](f: (Input) ⇒ ParseResult[T]): Parser[T] with OnceParser[T]

def Parser[T](f: (Input) ⇒ ParseResult[T]): Parser[T]

def accept[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

def accept[ES](es: ES)(implicit arg0: (ES) ⇒ List[Elem]): Parser[List[Elem]]

implicit def accept(e: Elem): Parser[Elem]

def acceptIf(p: (Elem) ⇒ Boolean)(err: (Elem) ⇒ String): Parser[Elem]

def acceptMatch[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

def acceptSeq[ES](es: ES)(implicit arg0: (ES) ⇒ Iterable[Elem]): Parser[List[Elem]]

def argPattern: Parser[ArgumentPattern]

final def asInstanceOf[T0]: T0

def assertionPattern: Parser[ProgramFragment]

def atomicConstraint: Parser[TokenConstraint]

def atomicExpression: Parser[NumericExpression]

def atomicGraphPattern: Parser[GraphPatternNode]

def atomicPattern: Parser[ProgramFragment]

def atomicPatternRev: Parser[ProgramFragment]

def capturePattern: Parser[ProgramFragment]

def capturePatternRev: Parser[ProgramFragment]

def chainl1[T, U](first: ⇒ Parser[T], p: ⇒ Parser[U], q: ⇒ Parser[(T, U) ⇒ T]): Parser[T]

def chainl1[T](p: ⇒ Parser[T], q: ⇒ Parser[(T, T) ⇒ T]): Parser[T]

def chainr1[T, U](p: ⇒ Parser[T], q: ⇒ Parser[(T, U) ⇒ U], combine: (T, U) ⇒ U, first: U): Parser[U]

def clone(): AnyRef

def commit[T](p: ⇒ Parser[T]): Parser[T]

def compareOps: Parser[String]

def compileGraphPattern(input: String): GraphPattern

def compileTokenPattern(input: String): TokenPattern

def concatGraphPattern: Parser[GraphPatternNode]

def concatPattern: Parser[ProgramFragment]

def concatPatternRev: Parser[ProgramFragment]

val config: OdinConfig

def conjunctiveConstraint: Parser[TokenConstraint]

def dependencyPattern: Parser[GraphPattern]

def disjunctiveConstraint: Parser[TokenConstraint]

def disjunctiveGraphPattern: Parser[GraphPatternNode]

def elem(e: Elem): Parser[Elem]

def elem(kind: String, p: (Elem) ⇒ Boolean): Parser[Elem]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def err(msg: String): Parser[Nothing]

def exactPattern: Parser[ProgramFragment]

def exactPatternRev: Parser[ProgramFragment]

def exactStringMatcher: Parser[ExactStringMatcher]

def failure(msg: String): Parser[Nothing]

def fieldConstraint: Parser[TokenConstraint]

def filterGraphPattern: Parser[GraphPatternNode]

def finalize(): Unit

final def getClass(): Class[_]

def guard[T](p: ⇒ Parser[T]): Parser[T]

def handleWhiteSpace(source: CharSequence, offset: Int): Int

def hashCode(): Int

def identifier: Parser[String]

def incomingMatcher: Parser[GraphPatternNode]

def incomingPattern: Parser[GraphPatternNode]

def incomingWildcard: Parser[GraphPatternNode]

def int: Parser[Int]

final def isInstanceOf[T0]: Boolean

implicit def literal(s: String): Parser[String]

def log[T](p: ⇒ Parser[T])(name: String): Parser[T]

def lookaheadAssertion: Parser[ProgramFragment]

def lookaroundGraphPattern: Parser[GraphPatternNode]