Inheritance diagram for joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie:

Collaboration diagram for joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie:

Classes
class	PackedChildIterator
class	PackedPhrasePair
class	PackedRule
Public Member Functions
final Trie	match (int token_id)
HashMap< Integer,?extends Trie >	getChildren ()
boolean	hasExtensions ()
ArrayList<?extends Trie >	getExtensions ()
boolean	hasRules ()
RuleCollection	getRuleCollection ()
List< Rule >	getRules ()
boolean	isSorted ()
List< Rule >	getSortedRules (List< FeatureFunction > featureFunctions)
int[]	getSourceSide ()
int	getArity ()
Iterator< Integer >	getTerminalExtensionIterator ()
Iterator< Integer >	getNonterminalExtensionIterator ()
Private Member Functions
	PackedTrie (int position)
	PackedTrie (int position, int[] parent_src, int parent_arity, int symbol)
synchronized void	sortRules (List< FeatureFunction > models)
Private Attributes
final int	position
boolean	sorted = false
int[]	src
int	arity

Detailed Description

A trie node within the grammar slice. Identified by its position within the source array, and, as a supplement, the source string leading from the trie root to the node.

Author:: jg

Constructor & Destructor Documentation

joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.PackedTrie ( int position ) [private]

joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.PackedTrie	(	int	position,
		int[]	parent_src,
		int	parent_arity,
		int	symbol
	)		`[private]`

Here is the call graph for this function:

Member Function Documentation

int joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getArity ( )

Gets the number of nonterminals in the source side of the rules in this RuleCollection. The source side is the same for all the rules in the RuleCollection, so the arity will also be the same for all of these rules.

Returns:: the (common) number of nonterminals in the source side of the rules in this RuleCollection

Implements joshua.decoder.ff.tm.RuleCollection.

Here is the caller graph for this function:

HashMap<Integer, ? extends Trie> joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getChildren ( )

If the trie node has extensions, get a list of their labels.

Returns:

Implements joshua.decoder.ff.tm.Trie.

Here is the call graph for this function:

ArrayList<? extends Trie> joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getExtensions ( )

If the trie node has extensions, then return a list of extended trie nodes, otherwise return null.

Returns:: A list of extended Trie nodes if this node has extensions, null otherwise

Implements joshua.decoder.ff.tm.Trie.

Here is the call graph for this function:

Iterator<Integer> joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getNonterminalExtensionIterator ( )

Returns an iterator over the trie node's extensions with nonterminal labels.

Returns:

Implements joshua.decoder.ff.tm.Trie.

RuleCollection joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getRuleCollection ( )

Retrieve the rules at the current node/state. The implementation of this method must adhere to the following laws:

The return value is always non-null. The collection may be empty however.
The collection must be empty if hasRules() is false, and must be non-empty if hasRules() is true.
The collection must be sorted (at least as used by TMGrammar)

Implements joshua.decoder.ff.tm.Trie.

List<Rule> joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getRules ( )

Get the list of rules. There are no guarantees about whether they're sorted or not.

Implements joshua.decoder.ff.tm.RuleCollection.

Here is the caller graph for this function:

List<Rule> joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getSortedRules ( List< FeatureFunction > models )

This returns a list of the rules, sorting them if necessary.

Implementations of this function should be synchronized.

Implements joshua.decoder.ff.tm.RuleCollection.

Here is the call graph for this function:

int [] joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getSourceSide ( )

Gets the source side for all rules in this RuleCollection. This source side is the same for all the rules in the RuleCollection.

Returns:: the (common) source side for all rules in this RuleCollection

Implements joshua.decoder.ff.tm.RuleCollection.

Iterator<Integer> joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.getTerminalExtensionIterator ( )

Returns an iterator over the trie node's extensions with terminal labels.

Returns:

Implements joshua.decoder.ff.tm.Trie.

boolean joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.hasExtensions ( )

Returns whether matchOne(Symbol) could succeed for any symbol.

Returns:: true if match(int) could succeed for some symbol, false otherwise

Implements joshua.decoder.ff.tm.Trie.

boolean joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.hasRules ( )

Gets whether the current node/state is a "final state" that has matching rules.

Returns:: true if the current node/state is a "final state" that has matching rules, false otherwise

Implements joshua.decoder.ff.tm.Trie.

boolean joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.isSorted ( )

We determine if the Trie is sorted by checking if the estimated cost of the first rule in the trie has been set.

Implements joshua.decoder.ff.tm.RuleCollection.

Here is the caller graph for this function:

final Trie joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.match ( int wordID )

Traverse one ply further down the trie. If there is no match, the result is null.

Parameters:

wordID

Returns:: Child node of this trie

Implements joshua.decoder.ff.tm.Trie.

Here is the call graph for this function:

Here is the caller graph for this function:

synchronized void joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.sortRules ( List< FeatureFunction > models ) [private]

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

int joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.arity [private]

final int joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.position [private]

boolean joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.sorted = false [private]

int [] joshua.decoder.ff.tm.packed.PackedGrammar.PackedSlice.PackedTrie.src [private]

Classes

Public Member Functions

Private Member Functions

Private Attributes

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation