public class LevenshteinLattice
extends java.lang.Object
| Modifier and Type | Field and Description |
|---|---|
protected static short |
COPY |
protected int[][] |
cost_lattice_ |
protected static short |
DELETE |
protected int |
delete_cost_ |
protected java.lang.String |
input_ |
protected static short |
INSERT |
protected int |
insert_cost_ |
protected short[][] |
op_lattice_ |
protected java.lang.String |
output_ |
protected static short |
REPLACE |
protected int |
replace_cost_ |
protected static short |
START |
| Constructor and Description |
|---|
LevenshteinLattice(java.lang.String input,
java.lang.String output) |
LevenshteinLattice(java.lang.String input,
java.lang.String output,
int insert_cost,
int delete_cost,
int replace_cost) |
| Modifier and Type | Method and Description |
|---|---|
protected java.util.List<java.util.List<java.lang.Character>> |
appendToList(java.util.List<java.util.List<java.lang.Character>> lists,
char c) |
protected void |
fillLattice() |
protected int |
getCopyCost(int input_index) |
int |
getDistance() |
protected int |
getReplaceCost(char input,
char output) |
protected void |
init() |
protected int |
min(int a,
int b,
int c) |
boolean |
redundant(java.util.List<java.lang.Character> seq) |
java.lang.String |
searchOperationSequence() |
java.util.List<java.util.List<java.lang.Character>> |
searchOperationSequences() |
java.util.List<java.util.List<java.lang.Character>> |
searchOperationSequences(boolean remove_redundant) |
java.util.List<java.util.List<java.lang.Character>> |
searchOperationSequences(int input_index,
int output_index) |
protected int[][] cost_lattice_
protected short[][] op_lattice_
protected static final short START
protected static final short INSERT
protected static final short DELETE
protected static final short COPY
protected static final short REPLACE
protected java.lang.String input_
protected java.lang.String output_
protected int replace_cost_
protected int insert_cost_
protected int delete_cost_
public LevenshteinLattice(java.lang.String input,
java.lang.String output)
public LevenshteinLattice(java.lang.String input,
java.lang.String output,
int insert_cost,
int delete_cost,
int replace_cost)
protected void init()
protected int min(int a,
int b,
int c)
protected void fillLattice()
protected int getCopyCost(int input_index)
protected int getReplaceCost(char input,
char output)
public java.lang.String searchOperationSequence()
public java.util.List<java.util.List<java.lang.Character>> searchOperationSequences(boolean remove_redundant)
public java.util.List<java.util.List<java.lang.Character>> searchOperationSequences()
public java.util.List<java.util.List<java.lang.Character>> searchOperationSequences(int input_index,
int output_index)
protected java.util.List<java.util.List<java.lang.Character>> appendToList(java.util.List<java.util.List<java.lang.Character>> lists,
char c)
public int getDistance()
public boolean redundant(java.util.List<java.lang.Character> seq)