parser.datastructures

Sanskrit Parser Data Structures

@author: Karthik Madathil (github: @kmadathil)

class sanskrit_parser.parser.datastructures.SandhiGraph

Bases: object

DAG class to hold Sandhi Lexical Analysis Results

Represents the results of lexical sandhi analysis as a DAG Nodes are SanskritObjects

add_end_edge(node)

Add an edge from node to end

add_node(node)

Extend dag with node inserted at root

Params:

Node (SanskritObject) : Node to add root (Boolean) : Make a root node end (Boolean) : Add an edge to end

add_roots(roots)

append_to_node(t, nodes)

Create edges from t to nodes

Params:

t (SanskritObject) : Node to append to nodes (iterator(nodes)) : Nodes to append to t

draw(*args, **kwargs)

end = '__end__'

find_all_paths(max_paths=10, sort=True, score=True)

Find all paths through DAG to End

Params:

max_paths (int :default:=10): Number of paths to find

If this is > 1000, all paths will be found

sort (bool)If True (default), sort paths

in ascending order of length

has_node(t)

Does a given node exist in the graph?

Params:

t (SanskritObject): Node

Returns:

boolean

lock_start()

Make the graph ready for search by adding a start node

Add a start node, add arcs to all current root nodes, and clear self.roots

score_graph()

start = '__start__'

write_dot(path)

class sanskrit_parser.parser.datastructures.VakyaGraph(path, max_parse_dc=4, fast_merge=True)

Bases: object

DAG class for Sanskrit Vakya Analysis

Represents Sanskrit Vakya Analysis as a DAG Nodes are SanskritObjects with morphological tags Edges are potential relationships between them

add_avyayas(bases)

Add Avyaya Links

add_bhavalakshana(krts, laks)

Add bhavalakshana edges from saptami krts to lakaras

add_conjunctions(bases)

Add samuccita links for conjunctions/disjunctions

add_edges()

add_karakas(bases)

Add karaka edges from base node (dhatu) base

add_kriya_kriya(lakaras, krts)

Add kriya-kriya edges from lakaras to krts

add_kriyavisheshana(bases)

Add kriyaviSezaRa edges from base node (dhatu) base

add_node(node)

Extend dag with node inserted at root

Params:

Node (VakyaGraphNode) : Node to add

add_non_karaka_vibhaktis()

Add Non-Karaka Vibhaktis

add_samastas()

Add samasta links from next samasta/tiN

add_sentence_conjunctions(laks, krts)

Add sentence conjunction links

For all nodes which match sentence_conjuction keys add vAkyasambanDaH link between y-t pair

• if vibhakti matches where relevant

Reverse all edges to node, add sambadDa- to link label (eg sambadDa-karma, if node is not vIpsa if node is saMyojakaH, and not vIpsA add saMbadDakriyA links to verbs if associated t* doesn’t exist vAkyasambanDaH links from verbs

add_shashthi()

Add zazWI-sambanDa links to next tiN

add_vipsa()

add_visheshana()

check_parse_validity()

Validity Check for parses

Remove parses with double kArakas Remove parses with multiple to edges into a node Remove parses with cycles

draw(*args, **kwargs)

find_krtverbs()

Find non ti~Nanta verbs

find_lakaras()

Find the ti~Nanta

get_dot_dict()

get_parses_dc()

Returns all parses

Uses modified Kruskal Algorithm to compute (generalized) spanning tree of k-partite VakyaGraph

lock()

write_dot(path)

class sanskrit_parser.parser.datastructures.VakyaParse(nodepair)

Bases: object

activate_and_extinguish_alternatives(node)

Make node active, extinguish other nodes in its partition

can_merge(other, length)

Can we merge two VakyaParses

copy()

Return a one level deep copy - in between a shallow and a fully deep copy

extend(pred, node)

Extend current parse with edge from pred to node

is_extinguished(node)

Is a node extinguished

is_safe(pred, node)

Checks if a partial parse is compatible with a given node and predecessor pair

merge_f(other)

Merge two VakyaParses: Fast method

merge_s(other, length)

Merge two VakyaParses: Slow method

sanskrit_parser.parser.datastructures.getSLP1Tagset(n)

Given a (base, tagset) pair, extract the tagset

Submodules

Indices and tables

• Index

• Module Index

• Search Page