<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT> package org.maltparser.core.syntaxgraph;<a name="line.1"></a>
<FONT color="green">002</FONT> <a name="line.2"></a>
<FONT color="green">003</FONT> import java.util.Iterator;<a name="line.3"></a>
<FONT color="green">004</FONT> import java.util.NoSuchElementException;<a name="line.4"></a>
<FONT color="green">005</FONT> import java.util.Observable;<a name="line.5"></a>
<FONT color="green">006</FONT> import java.util.Set;<a name="line.6"></a>
<FONT color="green">007</FONT> import java.util.SortedMap;<a name="line.7"></a>
<FONT color="green">008</FONT> import java.util.SortedSet;<a name="line.8"></a>
<FONT color="green">009</FONT> import java.util.TreeMap;<a name="line.9"></a>
<FONT color="green">010</FONT> import java.util.TreeSet;<a name="line.10"></a>
<FONT color="green">011</FONT> <a name="line.11"></a>
<FONT color="green">012</FONT> <a name="line.12"></a>
<FONT color="green">013</FONT> import org.maltparser.core.exception.MaltChainedException;<a name="line.13"></a>
<FONT color="green">014</FONT> import org.maltparser.core.helper.SystemLogger;<a name="line.14"></a>
<FONT color="green">015</FONT> import org.maltparser.core.pool.ObjectPoolList;<a name="line.15"></a>
<FONT color="green">016</FONT> import org.maltparser.core.symbol.SymbolTable;<a name="line.16"></a>
<FONT color="green">017</FONT> import org.maltparser.core.symbol.SymbolTableHandler;<a name="line.17"></a>
<FONT color="green">018</FONT> import org.maltparser.core.syntaxgraph.ds2ps.LosslessMapping;<a name="line.18"></a>
<FONT color="green">019</FONT> import org.maltparser.core.syntaxgraph.edge.Edge;<a name="line.19"></a>
<FONT color="green">020</FONT> import org.maltparser.core.syntaxgraph.edge.GraphEdge;<a name="line.20"></a>
<FONT color="green">021</FONT> import org.maltparser.core.syntaxgraph.node.ComparableNode;<a name="line.21"></a>
<FONT color="green">022</FONT> import org.maltparser.core.syntaxgraph.node.DependencyNode;<a name="line.22"></a>
<FONT color="green">023</FONT> import org.maltparser.core.syntaxgraph.node.Node;<a name="line.23"></a>
<FONT color="green">024</FONT> import org.maltparser.core.syntaxgraph.node.NonTerminal;<a name="line.24"></a>
<FONT color="green">025</FONT> import org.maltparser.core.syntaxgraph.node.NonTerminalNode;<a name="line.25"></a>
<FONT color="green">026</FONT> import org.maltparser.core.syntaxgraph.node.PhraseStructureNode;<a name="line.26"></a>
<FONT color="green">027</FONT> import org.maltparser.core.syntaxgraph.node.Root;<a name="line.27"></a>
<FONT color="green">028</FONT> import org.maltparser.core.syntaxgraph.node.TokenNode;<a name="line.28"></a>
<FONT color="green">029</FONT> /**<a name="line.29"></a>
<FONT color="green">030</FONT> *<a name="line.30"></a>
<FONT color="green">031</FONT> *<a name="line.31"></a>
<FONT color="green">032</FONT> * @author Johan Hall<a name="line.32"></a>
<FONT color="green">033</FONT> */<a name="line.33"></a>
<FONT color="green">034</FONT> public class MappablePhraseStructureGraph extends Sentence implements DependencyStructure, PhraseStructure {<a name="line.34"></a>
<FONT color="green">035</FONT> private final ObjectPoolList<Edge> edgePool;<a name="line.35"></a>
<FONT color="green">036</FONT> private final SortedSet<Edge> graphEdges;<a name="line.36"></a>
<FONT color="green">037</FONT> private Root root;<a name="line.37"></a>
<FONT color="green">038</FONT> private boolean singleHeadedConstraint;<a name="line.38"></a>
<FONT color="green">039</FONT> private final SortedMap<Integer, NonTerminal> nonTerminalNodes;<a name="line.39"></a>
<FONT color="green">040</FONT> private final ObjectPoolList<NonTerminal> nonTerminalPool;<a name="line.40"></a>
<FONT color="green">041</FONT> private LosslessMapping mapping;<a name="line.41"></a>
<FONT color="green">042</FONT> private RootLabels rootLabels;<a name="line.42"></a>
<FONT color="green">043</FONT> <a name="line.43"></a>
<FONT color="green">044</FONT> public MappablePhraseStructureGraph(SymbolTableHandler symbolTables) throws MaltChainedException {<a name="line.44"></a>
<FONT color="green">045</FONT> super(symbolTables);<a name="line.45"></a>
<FONT color="green">046</FONT> setSingleHeadedConstraint(true);<a name="line.46"></a>
<FONT color="green">047</FONT> root = new Root();<a name="line.47"></a>
<FONT color="green">048</FONT> root.setBelongsToGraph(this);<a name="line.48"></a>
<FONT color="green">049</FONT> graphEdges = new TreeSet<Edge>();<a name="line.49"></a>
<FONT color="green">050</FONT> edgePool = new ObjectPoolList<Edge>() {<a name="line.50"></a>
<FONT color="green">051</FONT> protected Edge create() { return new GraphEdge(); }<a name="line.51"></a>
<FONT color="green">052</FONT> public void resetObject(Edge o) throws MaltChainedException { o.clear(); }<a name="line.52"></a>
<FONT color="green">053</FONT> };<a name="line.53"></a>
<FONT color="green">054</FONT> <a name="line.54"></a>
<FONT color="green">055</FONT> nonTerminalNodes = new TreeMap<Integer,NonTerminal>();<a name="line.55"></a>
<FONT color="green">056</FONT> nonTerminalPool = new ObjectPoolList<NonTerminal>() {<a name="line.56"></a>
<FONT color="green">057</FONT> protected NonTerminal create() throws MaltChainedException { return new NonTerminal(); }<a name="line.57"></a>
<FONT color="green">058</FONT> public void resetObject(NonTerminal o) throws MaltChainedException { o.clear(); }<a name="line.58"></a>
<FONT color="green">059</FONT> };<a name="line.59"></a>
<FONT color="green">060</FONT> clear();<a name="line.60"></a>
<FONT color="green">061</FONT> }<a name="line.61"></a>
<FONT color="green">062</FONT> <a name="line.62"></a>
<FONT color="green">063</FONT> public DependencyNode addDependencyNode() throws MaltChainedException {<a name="line.63"></a>
<FONT color="green">064</FONT> return addTokenNode();<a name="line.64"></a>
<FONT color="green">065</FONT> }<a name="line.65"></a>
<FONT color="green">066</FONT> <a name="line.66"></a>
<FONT color="green">067</FONT> public DependencyNode addDependencyNode(int index) throws MaltChainedException {<a name="line.67"></a>
<FONT color="green">068</FONT> if (index == 0) {<a name="line.68"></a>
<FONT color="green">069</FONT> return root;<a name="line.69"></a>
<FONT color="green">070</FONT> }<a name="line.70"></a>
<FONT color="green">071</FONT> return addTokenNode(index);<a name="line.71"></a>
<FONT color="green">072</FONT> }<a name="line.72"></a>
<FONT color="green">073</FONT> <a name="line.73"></a>
<FONT color="green">074</FONT> public DependencyNode getDependencyNode(int index) throws MaltChainedException {<a name="line.74"></a>
<FONT color="green">075</FONT> if (index == 0) {<a name="line.75"></a>
<FONT color="green">076</FONT> return root;<a name="line.76"></a>
<FONT color="green">077</FONT> } <a name="line.77"></a>
<FONT color="green">078</FONT> return getTokenNode(index);<a name="line.78"></a>
<FONT color="green">079</FONT> }<a name="line.79"></a>
<FONT color="green">080</FONT> <a name="line.80"></a>
<FONT color="green">081</FONT> public int nDependencyNode() {<a name="line.81"></a>
<FONT color="green">082</FONT> return nTokenNode() + 1;<a name="line.82"></a>
<FONT color="green">083</FONT> }<a name="line.83"></a>
<FONT color="green">084</FONT> <a name="line.84"></a>
<FONT color="green">085</FONT> public int getHighestDependencyNodeIndex() {<a name="line.85"></a>
<FONT color="green">086</FONT> if (hasTokens()) {<a name="line.86"></a>
<FONT color="green">087</FONT> return getHighestTokenIndex();<a name="line.87"></a>
<FONT color="green">088</FONT> }<a name="line.88"></a>
<FONT color="green">089</FONT> return 0;<a name="line.89"></a>
<FONT color="green">090</FONT> }<a name="line.90"></a>
<FONT color="green">091</FONT> <a name="line.91"></a>
<FONT color="green">092</FONT> public Edge addDependencyEdge(int headIndex, int dependentIndex) throws MaltChainedException {<a name="line.92"></a>
<FONT color="green">093</FONT> DependencyNode head = null;<a name="line.93"></a>
<FONT color="green">094</FONT> DependencyNode dependent = null;<a name="line.94"></a>
<FONT color="green">095</FONT> if (headIndex == 0) {<a name="line.95"></a>
<FONT color="green">096</FONT> head = root;<a name="line.96"></a>
<FONT color="green">097</FONT> } else if (headIndex > 0) {<a name="line.97"></a>
<FONT color="green">098</FONT> head = getOrAddTerminalNode(headIndex);<a name="line.98"></a>
<FONT color="green">099</FONT> }<a name="line.99"></a>
<FONT color="green">100</FONT> <a name="line.100"></a>
<FONT color="green">101</FONT> if (dependentIndex > 0) {<a name="line.101"></a>
<FONT color="green">102</FONT> dependent = getOrAddTerminalNode(dependentIndex);<a name="line.102"></a>
<FONT color="green">103</FONT> }<a name="line.103"></a>
<FONT color="green">104</FONT> return addDependencyEdge(head, dependent);<a name="line.104"></a>
<FONT color="green">105</FONT> }<a name="line.105"></a>
<FONT color="green">106</FONT> <a name="line.106"></a>
<FONT color="green">107</FONT> public Edge addDependencyEdge(DependencyNode head, DependencyNode dependent) throws MaltChainedException {<a name="line.107"></a>
<FONT color="green">108</FONT> if (head == null || dependent == null || head.getBelongsToGraph() != this || dependent.getBelongsToGraph() != this) {<a name="line.108"></a>
<FONT color="green">109</FONT> throw new SyntaxGraphException("Head or dependent node is missing.");<a name="line.109"></a>
<FONT color="green">110</FONT> } else if (!dependent.isRoot()) {<a name="line.110"></a>
<FONT color="green">111</FONT> if (singleHeadedConstraint && dependent.hasHead()) {<a name="line.111"></a>
<FONT color="green">112</FONT> throw new SyntaxGraphException("The dependent already have a head. ");<a name="line.112"></a>
<FONT color="green">113</FONT> }<a name="line.113"></a>
<FONT color="green">114</FONT> DependencyNode hc = ((DependencyNode)head).findComponent();<a name="line.114"></a>
<FONT color="green">115</FONT> DependencyNode dc = ((DependencyNode)dependent).findComponent();<a name="line.115"></a>
<FONT color="green">116</FONT> if (hc != dc) {<a name="line.116"></a>
<FONT color="green">117</FONT> link(hc, dc);<a name="line.117"></a>
<FONT color="green">118</FONT> numberOfComponents--; <a name="line.118"></a>
<FONT color="green">119</FONT> }<a name="line.119"></a>
<FONT color="green">120</FONT> Edge e = edgePool.checkOut();<a name="line.120"></a>
<FONT color="green">121</FONT> e.setBelongsToGraph(this);<a name="line.121"></a>
<FONT color="green">122</FONT> e.setEdge((Node)head, (Node)dependent, Edge.DEPENDENCY_EDGE);<a name="line.122"></a>
<FONT color="green">123</FONT> graphEdges.add(e);<a name="line.123"></a>
<FONT color="green">124</FONT> return e;<a name="line.124"></a>
<FONT color="green">125</FONT> } else {<a name="line.125"></a>
<FONT color="green">126</FONT> throw new SyntaxGraphException("Head node is not a root node or a terminal node.");<a name="line.126"></a>
<FONT color="green">127</FONT> }<a name="line.127"></a>
<FONT color="green">128</FONT> }<a name="line.128"></a>
<FONT color="green">129</FONT> <a name="line.129"></a>
<FONT color="green">130</FONT> public Edge moveDependencyEdge(int newHeadIndex, int dependentIndex) throws MaltChainedException {<a name="line.130"></a>
<FONT color="green">131</FONT> DependencyNode newHead = null;<a name="line.131"></a>
<FONT color="green">132</FONT> DependencyNode dependent = null;<a name="line.132"></a>
<FONT color="green">133</FONT> if (newHeadIndex == 0) {<a name="line.133"></a>
<FONT color="green">134</FONT> newHead = root;<a name="line.134"></a>
<FONT color="green">135</FONT> } else if (newHeadIndex > 0) {<a name="line.135"></a>
<FONT color="green">136</FONT> newHead = terminalNodes.get(newHeadIndex);<a name="line.136"></a>
<FONT color="green">137</FONT> }<a name="line.137"></a>
<FONT color="green">138</FONT> <a name="line.138"></a>
<FONT color="green">139</FONT> if (dependentIndex > 0) {<a name="line.139"></a>
<FONT color="green">140</FONT> dependent = terminalNodes.get(dependentIndex);<a name="line.140"></a>
<FONT color="green">141</FONT> }<a name="line.141"></a>
<FONT color="green">142</FONT> return moveDependencyEdge(newHead, dependent);<a name="line.142"></a>
<FONT color="green">143</FONT> }<a name="line.143"></a>
<FONT color="green">144</FONT> <a name="line.144"></a>
<FONT color="green">145</FONT> public Edge moveDependencyEdge(DependencyNode newHead, DependencyNode dependent) throws MaltChainedException {<a name="line.145"></a>
<FONT color="green">146</FONT> if (dependent == null || !dependent.hasHead() || newHead.getBelongsToGraph() != this || dependent.getBelongsToGraph() != this) {<a name="line.146"></a>
<FONT color="green">147</FONT> return null;<a name="line.147"></a>
<FONT color="green">148</FONT> }<a name="line.148"></a>
<FONT color="green">149</FONT> Edge headEdge = dependent.getHeadEdge();<a name="line.149"></a>
<FONT color="green">150</FONT> <a name="line.150"></a>
<FONT color="green">151</FONT> LabelSet labels = null;<a name="line.151"></a>
<FONT color="green">152</FONT> if (headEdge.isLabeled()) { <a name="line.152"></a>
<FONT color="green">153</FONT> labels = checkOutNewLabelSet();<a name="line.153"></a>
<FONT color="green">154</FONT> for (SymbolTable table : headEdge.getLabelTypes()) {<a name="line.154"></a>
<FONT color="green">155</FONT> labels.put(table, headEdge.getLabelCode(table));<a name="line.155"></a>
<FONT color="green">156</FONT> }<a name="line.156"></a>
<FONT color="green">157</FONT> }<a name="line.157"></a>
<FONT color="green">158</FONT> headEdge.clear();<a name="line.158"></a>
<FONT color="green">159</FONT> headEdge.setBelongsToGraph(this);<a name="line.159"></a>
<FONT color="green">160</FONT> headEdge.setEdge((Node)newHead, (Node)dependent, Edge.DEPENDENCY_EDGE);<a name="line.160"></a>
<FONT color="green">161</FONT> if (labels != null) {<a name="line.161"></a>
<FONT color="green">162</FONT> headEdge.addLabel(labels);<a name="line.162"></a>
<FONT color="green">163</FONT> labels.clear();<a name="line.163"></a>
<FONT color="green">164</FONT> checkInLabelSet(labels);<a name="line.164"></a>
<FONT color="green">165</FONT> }<a name="line.165"></a>
<FONT color="green">166</FONT> return headEdge;<a name="line.166"></a>
<FONT color="green">167</FONT> }<a name="line.167"></a>
<FONT color="green">168</FONT> <a name="line.168"></a>
<FONT color="green">169</FONT> public void removeDependencyEdge(int headIndex, int dependentIndex) throws MaltChainedException {<a name="line.169"></a>
<FONT color="green">170</FONT> Node head = null;<a name="line.170"></a>
<FONT color="green">171</FONT> Node dependent = null;<a name="line.171"></a>
<FONT color="green">172</FONT> if (headIndex == 0) {<a name="line.172"></a>
<FONT color="green">173</FONT> head = root;<a name="line.173"></a>
<FONT color="green">174</FONT> } else if (headIndex > 0) {<a name="line.174"></a>
<FONT color="green">175</FONT> head = terminalNodes.get(headIndex);<a name="line.175"></a>
<FONT color="green">176</FONT> }<a name="line.176"></a>
<FONT color="green">177</FONT> <a name="line.177"></a>
<FONT color="green">178</FONT> if (dependentIndex > 0) {<a name="line.178"></a>
<FONT color="green">179</FONT> dependent = terminalNodes.get(dependentIndex);<a name="line.179"></a>
<FONT color="green">180</FONT> }<a name="line.180"></a>
<FONT color="green">181</FONT> removeDependencyEdge(head, dependent);<a name="line.181"></a>
<FONT color="green">182</FONT> }<a name="line.182"></a>
<FONT color="green">183</FONT> <a name="line.183"></a>
<FONT color="green">184</FONT> protected void removeDependencyEdge(Node head, Node dependent) throws MaltChainedException {<a name="line.184"></a>
<FONT color="green">185</FONT> if (head == null || dependent == null || head.getBelongsToGraph() != this || dependent.getBelongsToGraph() != this) {<a name="line.185"></a>
<FONT color="green">186</FONT> throw new SyntaxGraphException("Head or dependent node is missing.");<a name="line.186"></a>
<FONT color="green">187</FONT> } else if (!dependent.isRoot()) {<a name="line.187"></a>
<FONT color="green">188</FONT> Iterator<Edge> ie = dependent.getIncomingEdgeIterator();<a name="line.188"></a>
<FONT color="green">189</FONT> while (ie.hasNext()) {<a name="line.189"></a>
<FONT color="green">190</FONT> Edge e = ie.next();<a name="line.190"></a>
<FONT color="green">191</FONT> if (e.getSource() == head) {<a name="line.191"></a>
<FONT color="green">192</FONT> ie.remove();<a name="line.192"></a>
<FONT color="green">193</FONT> graphEdges.remove(e);<a name="line.193"></a>
<FONT color="green">194</FONT> edgePool.checkIn(e);<a name="line.194"></a>
<FONT color="green">195</FONT> }<a name="line.195"></a>
<FONT color="green">196</FONT> } <a name="line.196"></a>
<FONT color="green">197</FONT> } else {<a name="line.197"></a>
<FONT color="green">198</FONT> throw new SyntaxGraphException("Head node is not a root node or a terminal node.");<a name="line.198"></a>
<FONT color="green">199</FONT> }<a name="line.199"></a>
<FONT color="green">200</FONT> }<a name="line.200"></a>
<FONT color="green">201</FONT> <a name="line.201"></a>
<FONT color="green">202</FONT> public Edge addSecondaryEdge(ComparableNode source, ComparableNode target) throws MaltChainedException {<a name="line.202"></a>
<FONT color="green">203</FONT> if (source == null || target == null || source.getBelongsToGraph() != this || target.getBelongsToGraph() != this) {<a name="line.203"></a>
<FONT color="green">204</FONT> throw new SyntaxGraphException("Head or dependent node is missing.");<a name="line.204"></a>
<FONT color="green">205</FONT> } else if (!target.isRoot()) {<a name="line.205"></a>
<FONT color="green">206</FONT> Edge e = edgePool.checkOut();<a name="line.206"></a>
<FONT color="green">207</FONT> e.setBelongsToGraph(this);<a name="line.207"></a>
<FONT color="green">208</FONT> e.setEdge((Node)source, (Node)target, Edge.SECONDARY_EDGE);<a name="line.208"></a>
<FONT color="green">209</FONT> graphEdges.add(e);<a name="line.209"></a>
<FONT color="green">210</FONT> return e;<a name="line.210"></a>
<FONT color="green">211</FONT> }<a name="line.211"></a>
<FONT color="green">212</FONT> return null;<a name="line.212"></a>
<FONT color="green">213</FONT> }<a name="line.213"></a>
<FONT color="green">214</FONT> <a name="line.214"></a>
<FONT color="green">215</FONT> public void removeSecondaryEdge(ComparableNode source, ComparableNode target) throws MaltChainedException {<a name="line.215"></a>
<FONT color="green">216</FONT> if (source == null || target == null || source.getBelongsToGraph() != this || target.getBelongsToGraph() != this) {<a name="line.216"></a>
<FONT color="green">217</FONT> throw new SyntaxGraphException("Head or dependent node is missing.");<a name="line.217"></a>
<FONT color="green">218</FONT> } else if (!target.isRoot()) {<a name="line.218"></a>
<FONT color="green">219</FONT> Iterator<Edge> ie = ((Node)target).getIncomingEdgeIterator();<a name="line.219"></a>
<FONT color="green">220</FONT> while (ie.hasNext()) {<a name="line.220"></a>
<FONT color="green">221</FONT> Edge e = ie.next();<a name="line.221"></a>
<FONT color="green">222</FONT> if (e.getSource() == source) {<a name="line.222"></a>
<FONT color="green">223</FONT> ie.remove();<a name="line.223"></a>
<FONT color="green">224</FONT> graphEdges.remove(e);<a name="line.224"></a>
<FONT color="green">225</FONT> edgePool.checkIn(e);<a name="line.225"></a>
<FONT color="green">226</FONT> }<a name="line.226"></a>
<FONT color="green">227</FONT> }<a name="line.227"></a>
<FONT color="green">228</FONT> }<a name="line.228"></a>
<FONT color="green">229</FONT> }<a name="line.229"></a>
<FONT color="green">230</FONT> <a name="line.230"></a>
<FONT color="green">231</FONT> public boolean hasLabeledDependency(int index) throws MaltChainedException {<a name="line.231"></a>
<FONT color="green">232</FONT> return (getDependencyNode(index).hasHead() && getDependencyNode(index).getHeadEdge().isLabeled());<a name="line.232"></a>
<FONT color="green">233</FONT> }<a name="line.233"></a>
<FONT color="green">234</FONT> <a name="line.234"></a>
<FONT color="green">235</FONT> public boolean isConnected() {<a name="line.235"></a>
<FONT color="green">236</FONT> return (numberOfComponents == 1);<a name="line.236"></a>
<FONT color="green">237</FONT> }<a name="line.237"></a>
<FONT color="green">238</FONT> <a name="line.238"></a>
<FONT color="green">239</FONT> public boolean isProjective() throws MaltChainedException {<a name="line.239"></a>
<FONT color="green">240</FONT> for (int i : terminalNodes.keySet()) {<a name="line.240"></a>
<FONT color="green">241</FONT> if (!terminalNodes.get(i).isProjective()) {<a name="line.241"></a>
<FONT color="green">242</FONT> return false;<a name="line.242"></a>
<FONT color="green">243</FONT> }<a name="line.243"></a>
<FONT color="green">244</FONT> }<a name="line.244"></a>
<FONT color="green">245</FONT> return true;<a name="line.245"></a>
<FONT color="green">246</FONT> }<a name="line.246"></a>
<FONT color="green">247</FONT> <a name="line.247"></a>
<FONT color="green">248</FONT> public boolean isTree() {<a name="line.248"></a>
<FONT color="green">249</FONT> return isConnected() && isSingleHeaded();<a name="line.249"></a>
<FONT color="green">250</FONT> }<a name="line.250"></a>
<FONT color="green">251</FONT> <a name="line.251"></a>
<FONT color="green">252</FONT> public boolean isSingleHeaded() {<a name="line.252"></a>
<FONT color="green">253</FONT> for (int i : terminalNodes.keySet()) {<a name="line.253"></a>
<FONT color="green">254</FONT> if (!terminalNodes.get(i).hasAtMostOneHead()) {<a name="line.254"></a>
<FONT color="green">255</FONT> return false;<a name="line.255"></a>
<FONT color="green">256</FONT> }<a name="line.256"></a>
<FONT color="green">257</FONT> }<a name="line.257"></a>
<FONT color="green">258</FONT> return true;<a name="line.258"></a>
<FONT color="green">259</FONT> }<a name="line.259"></a>
<FONT color="green">260</FONT> <a name="line.260"></a>
<FONT color="green">261</FONT> public boolean isSingleHeadedConstraint() {<a name="line.261"></a>
<FONT color="green">262</FONT> return singleHeadedConstraint;<a name="line.262"></a>
<FONT color="green">263</FONT> }<a name="line.263"></a>
<FONT color="green">264</FONT> <a name="line.264"></a>
<FONT color="green">265</FONT> public void setSingleHeadedConstraint(boolean singleHeadedConstraint) {<a name="line.265"></a>
<FONT color="green">266</FONT> this.singleHeadedConstraint = singleHeadedConstraint;<a name="line.266"></a>
<FONT color="green">267</FONT> }<a name="line.267"></a>
<FONT color="green">268</FONT> <a name="line.268"></a>
<FONT color="green">269</FONT> public int nNonProjectiveEdges() throws MaltChainedException {<a name="line.269"></a>
<FONT color="green">270</FONT> int c = 0;<a name="line.270"></a>
<FONT color="green">271</FONT> for (int i : terminalNodes.keySet()) {<a name="line.271"></a>
<FONT color="green">272</FONT> if (!terminalNodes.get(i).isProjective()) {<a name="line.272"></a>
<FONT color="green">273</FONT> c++;<a name="line.273"></a>
<FONT color="green">274</FONT> }<a name="line.274"></a>
<FONT color="green">275</FONT> }<a name="line.275"></a>
<FONT color="green">276</FONT> return c;<a name="line.276"></a>
<FONT color="green">277</FONT> }<a name="line.277"></a>
<FONT color="green">278</FONT> <a name="line.278"></a>
<FONT color="green">279</FONT> public int nEdges() {<a name="line.279"></a>
<FONT color="green">280</FONT> return graphEdges.size();<a name="line.280"></a>
<FONT color="green">281</FONT> }<a name="line.281"></a>
<FONT color="green">282</FONT> <a name="line.282"></a>
<FONT color="green">283</FONT> public SortedSet<Edge> getEdges() {<a name="line.283"></a>
<FONT color="green">284</FONT> return graphEdges;<a name="line.284"></a>
<FONT color="green">285</FONT> }<a name="line.285"></a>
<FONT color="green">286</FONT> <a name="line.286"></a>
<FONT color="green">287</FONT> public SortedSet<Integer> getDependencyIndices() {<a name="line.287"></a>
<FONT color="green">288</FONT> SortedSet<Integer> indices = new TreeSet<Integer>(terminalNodes.keySet());<a name="line.288"></a>
<FONT color="green">289</FONT> indices.add(0);<a name="line.289"></a>
<FONT color="green">290</FONT> return indices;<a name="line.290"></a>
<FONT color="green">291</FONT> }<a name="line.291"></a>
<FONT color="green">292</FONT> <a name="line.292"></a>
<FONT color="green">293</FONT> protected DependencyNode link(DependencyNode x, DependencyNode y) {<a name="line.293"></a>
<FONT color="green">294</FONT> if (x.getRank() > y.getRank()) {<a name="line.294"></a>
<FONT color="green">295</FONT> y.setComponent(x);<a name="line.295"></a>
<FONT color="green">296</FONT> } else {<a name="line.296"></a>
<FONT color="green">297</FONT> x.setComponent(y);<a name="line.297"></a>
<FONT color="green">298</FONT> if (x.getRank() == y.getRank()) {<a name="line.298"></a>
<FONT color="green">299</FONT> y.setRank(y.getRank()+1);<a name="line.299"></a>
<FONT color="green">300</FONT> }<a name="line.300"></a>
<FONT color="green">301</FONT> return y;<a name="line.301"></a>
<FONT color="green">302</FONT> }<a name="line.302"></a>
<FONT color="green">303</FONT> return x;<a name="line.303"></a>
<FONT color="green">304</FONT> }<a name="line.304"></a>
<FONT color="green">305</FONT> <a name="line.305"></a>
<FONT color="green">306</FONT> public void linkAllTerminalsToRoot() throws MaltChainedException {<a name="line.306"></a>
<FONT color="green">307</FONT> clear();<a name="line.307"></a>
<FONT color="green">308</FONT> <a name="line.308"></a>
<FONT color="green">309</FONT> for (int i : terminalNodes.keySet()) {<a name="line.309"></a>
<FONT color="green">310</FONT> DependencyNode node = terminalNodes.get(i);<a name="line.310"></a>
<FONT color="green">311</FONT> addDependencyEdge(root,node);<a name="line.311"></a>
<FONT color="green">312</FONT> }<a name="line.312"></a>
<FONT color="green">313</FONT> }<a name="line.313"></a>
<FONT color="green">314</FONT> <a name="line.314"></a>
<FONT color="green">315</FONT> public void linkAllTreesToRoot() throws MaltChainedException {<a name="line.315"></a>
<FONT color="green">316</FONT> for (int i : terminalNodes.keySet()) {<a name="line.316"></a>
<FONT color="green">317</FONT> if (!terminalNodes.get(i).hasHead()) {<a name="line.317"></a>
<FONT color="green">318</FONT> Edge e = addDependencyEdge(root,terminalNodes.get(i));<a name="line.318"></a>
<FONT color="green">319</FONT> mapping.updatePhraseStructureGraph(this, e, false);<a name="line.319"></a>
<FONT color="green">320</FONT> }<a name="line.320"></a>
<FONT color="green">321</FONT> }<a name="line.321"></a>
<FONT color="green">322</FONT> }<a name="line.322"></a>
<FONT color="green">323</FONT> <a name="line.323"></a>
<FONT color="green">324</FONT> public LabelSet getDefaultRootEdgeLabels() throws MaltChainedException {<a name="line.324"></a>
<FONT color="green">325</FONT> if (rootLabels == null) {<a name="line.325"></a>
<FONT color="green">326</FONT> return null;<a name="line.326"></a>
<FONT color="green">327</FONT> }<a name="line.327"></a>
<FONT color="green">328</FONT> return rootLabels.getDefaultRootLabels();<a name="line.328"></a>
<FONT color="green">329</FONT> }<a name="line.329"></a>
<FONT color="green">330</FONT> <a name="line.330"></a>
<FONT color="green">331</FONT> public String getDefaultRootEdgeLabelSymbol(SymbolTable table) throws MaltChainedException {<a name="line.331"></a>
<FONT color="green">332</FONT> if (rootLabels == null) {<a name="line.332"></a>
<FONT color="green">333</FONT> return null;<a name="line.333"></a>
<FONT color="green">334</FONT> }<a name="line.334"></a>
<FONT color="green">335</FONT> return rootLabels.getDefaultRootLabelSymbol(table);<a name="line.335"></a>
<FONT color="green">336</FONT> }<a name="line.336"></a>
<FONT color="green">337</FONT> <a name="line.337"></a>
<FONT color="green">338</FONT> public int getDefaultRootEdgeLabelCode(SymbolTable table) throws MaltChainedException {<a name="line.338"></a>
<FONT color="green">339</FONT> if (rootLabels == null) {<a name="line.339"></a>
<FONT color="green">340</FONT> return -1;<a name="line.340"></a>
<FONT color="green">341</FONT> }<a name="line.341"></a>
<FONT color="green">342</FONT> return rootLabels.getDefaultRootLabelCode(table);<a name="line.342"></a>
<FONT color="green">343</FONT> }<a name="line.343"></a>
<FONT color="green">344</FONT> <a name="line.344"></a>
<FONT color="green">345</FONT> public void setDefaultRootEdgeLabel(SymbolTable table, String defaultRootSymbol) throws MaltChainedException {<a name="line.345"></a>
<FONT color="green">346</FONT> if (rootLabels == null) {<a name="line.346"></a>
<FONT color="green">347</FONT> rootLabels = new RootLabels();<a name="line.347"></a>
<FONT color="green">348</FONT> }<a name="line.348"></a>
<FONT color="green">349</FONT> rootLabels.setDefaultRootLabel(table, defaultRootSymbol);<a name="line.349"></a>
<FONT color="green">350</FONT> }<a name="line.350"></a>
<FONT color="green">351</FONT> <a name="line.351"></a>
<FONT color="green">352</FONT> public void setDefaultRootEdgeLabels(String rootLabelOption, SortedMap<String, SymbolTable> edgeSymbolTables) throws MaltChainedException {<a name="line.352"></a>
<FONT color="green">353</FONT> if (rootLabels == null) {<a name="line.353"></a>
<FONT color="green">354</FONT> rootLabels = new RootLabels();<a name="line.354"></a>
<FONT color="green">355</FONT> }<a name="line.355"></a>
<FONT color="green">356</FONT> rootLabels.setRootLabels(rootLabelOption, edgeSymbolTables);<a name="line.356"></a>
<FONT color="green">357</FONT> }<a name="line.357"></a>
<FONT color="green">358</FONT> <a name="line.358"></a>
<FONT color="green">359</FONT> public void clear() throws MaltChainedException {<a name="line.359"></a>
<FONT color="green">360</FONT> edgePool.checkInAll();<a name="line.360"></a>
<FONT color="green">361</FONT> graphEdges.clear();<a name="line.361"></a>
<FONT color="green">362</FONT> root.clear();<a name="line.362"></a>
<FONT color="green">363</FONT> root.setBelongsToGraph(this);<a name="line.363"></a>
<FONT color="green">364</FONT> nonTerminalPool.checkInAll();<a name="line.364"></a>
<FONT color="green">365</FONT> nonTerminalNodes.clear();<a name="line.365"></a>
<FONT color="green">366</FONT> if (mapping != null) {<a name="line.366"></a>
<FONT color="green">367</FONT> mapping.clear(); <a name="line.367"></a>
<FONT color="green">368</FONT> }<a name="line.368"></a>
<FONT color="green">369</FONT> super.clear();<a name="line.369"></a>
<FONT color="green">370</FONT> <a name="line.370"></a>
<FONT color="green">371</FONT> numberOfComponents++;<a name="line.371"></a>
<FONT color="green">372</FONT> }<a name="line.372"></a>
<FONT color="green">373</FONT> <a name="line.373"></a>
<FONT color="green">374</FONT> public DependencyNode getDependencyRoot() {<a name="line.374"></a>
<FONT color="green">375</FONT> return root;<a name="line.375"></a>
<FONT color="green">376</FONT> }<a name="line.376"></a>
<FONT color="green">377</FONT> <a name="line.377"></a>
<FONT color="green">378</FONT> public PhraseStructureNode addTerminalNode() throws MaltChainedException {<a name="line.378"></a>
<FONT color="green">379</FONT> return addTokenNode();<a name="line.379"></a>
<FONT color="green">380</FONT> }<a name="line.380"></a>
<FONT color="green">381</FONT> <a name="line.381"></a>
<FONT color="green">382</FONT> public PhraseStructureNode addTerminalNode(int index) throws MaltChainedException {<a name="line.382"></a>
<FONT color="green">383</FONT> return addTokenNode(index);<a name="line.383"></a>
<FONT color="green">384</FONT> }<a name="line.384"></a>
<FONT color="green">385</FONT> <a name="line.385"></a>
<FONT color="green">386</FONT> public PhraseStructureNode getTerminalNode(int index) {<a name="line.386"></a>
<FONT color="green">387</FONT> return getTokenNode(index);<a name="line.387"></a>
<FONT color="green">388</FONT> }<a name="line.388"></a>
<FONT color="green">389</FONT> <a name="line.389"></a>
<FONT color="green">390</FONT> public int nTerminalNode() {<a name="line.390"></a>
<FONT color="green">391</FONT> return nTokenNode();<a name="line.391"></a>
<FONT color="green">392</FONT> }<a name="line.392"></a>
<FONT color="green">393</FONT> <a name="line.393"></a>
<FONT color="green">394</FONT> public PhraseStructureNode addNonTerminalNode(int index) throws MaltChainedException {<a name="line.394"></a>
<FONT color="green">395</FONT> NonTerminal node = nonTerminalPool.checkOut();<a name="line.395"></a>
<FONT color="green">396</FONT> node.setIndex(index);<a name="line.396"></a>
<FONT color="green">397</FONT> node.setBelongsToGraph(this);<a name="line.397"></a>
<FONT color="green">398</FONT> nonTerminalNodes.put(index,node);<a name="line.398"></a>
<FONT color="green">399</FONT> return node;<a name="line.399"></a>
<FONT color="green">400</FONT> }<a name="line.400"></a>
<FONT color="green">401</FONT> <a name="line.401"></a>
<FONT color="green">402</FONT> public PhraseStructureNode addNonTerminalNode() throws MaltChainedException {<a name="line.402"></a>
<FONT color="green">403</FONT> int index = getHighestNonTerminalIndex();<a name="line.403"></a>
<FONT color="green">404</FONT> if (index > 0) {<a name="line.404"></a>
<FONT color="green">405</FONT> return addNonTerminalNode(index+1);<a name="line.405"></a>
<FONT color="green">406</FONT> }<a name="line.406"></a>
<FONT color="green">407</FONT> return addNonTerminalNode(1);<a name="line.407"></a>
<FONT color="green">408</FONT> }<a name="line.408"></a>
<FONT color="green">409</FONT> <a name="line.409"></a>
<FONT color="green">410</FONT> public PhraseStructureNode getNonTerminalNode(int index) throws MaltChainedException {<a name="line.410"></a>
<FONT color="green">411</FONT> return nonTerminalNodes.get(index);<a name="line.411"></a>
<FONT color="green">412</FONT> }<a name="line.412"></a>
<FONT color="green">413</FONT> <a name="line.413"></a>
<FONT color="green">414</FONT> public int getHighestNonTerminalIndex() {<a name="line.414"></a>
<FONT color="green">415</FONT> try {<a name="line.415"></a>
<FONT color="green">416</FONT> return nonTerminalNodes.lastKey();<a name="line.416"></a>
<FONT color="green">417</FONT> } catch (NoSuchElementException e) {<a name="line.417"></a>
<FONT color="green">418</FONT> return 0;<a name="line.418"></a>
<FONT color="green">419</FONT> }<a name="line.419"></a>
<FONT color="green">420</FONT> }<a name="line.420"></a>
<FONT color="green">421</FONT> <a name="line.421"></a>
<FONT color="green">422</FONT> public Set<Integer> getNonTerminalIndices() {<a name="line.422"></a>
<FONT color="green">423</FONT> return new TreeSet<Integer>(nonTerminalNodes.keySet());<a name="line.423"></a>
<FONT color="green">424</FONT> }<a name="line.424"></a>
<FONT color="green">425</FONT> <a name="line.425"></a>
<FONT color="green">426</FONT> public boolean hasNonTerminals() {<a name="line.426"></a>
<FONT color="green">427</FONT> return !nonTerminalNodes.isEmpty();<a name="line.427"></a>
<FONT color="green">428</FONT> }<a name="line.428"></a>
<FONT color="green">429</FONT> <a name="line.429"></a>
<FONT color="green">430</FONT> public int nNonTerminals() {<a name="line.430"></a>
<FONT color="green">431</FONT> return nonTerminalNodes.size();<a name="line.431"></a>
<FONT color="green">432</FONT> }<a name="line.432"></a>
<FONT color="green">433</FONT> <a name="line.433"></a>
<FONT color="green">434</FONT> public PhraseStructureNode getPhraseStructureRoot() {<a name="line.434"></a>
<FONT color="green">435</FONT> return root;<a name="line.435"></a>
<FONT color="green">436</FONT> }<a name="line.436"></a>
<FONT color="green">437</FONT> <a name="line.437"></a>
<FONT color="green">438</FONT> public Edge addPhraseStructureEdge(PhraseStructureNode parent, PhraseStructureNode child) throws MaltChainedException {<a name="line.438"></a>
<FONT color="green">439</FONT> if (parent == null || child == null) {<a name="line.439"></a>
<FONT color="green">440</FONT> throw new MaltChainedException("Parent or child node is missing in sentence "+getSentenceID());<a name="line.440"></a>
<FONT color="green">441</FONT> } else if (parent.getBelongsToGraph() != this || child.getBelongsToGraph() != this) {<a name="line.441"></a>
<FONT color="green">442</FONT> throw new MaltChainedException("Parent or child node is not a member of the graph in sentence "+getSentenceID());<a name="line.442"></a>
<FONT color="green">443</FONT> } else if (parent == child) {<a name="line.443"></a>
<FONT color="green">444</FONT> throw new MaltChainedException("It is not allowed to add a phrase structure edge connecting the same node in sentence "+getSentenceID());<a name="line.444"></a>
<FONT color="green">445</FONT> } else if (parent instanceof NonTerminalNode && !child.isRoot()) {<a name="line.445"></a>
<FONT color="green">446</FONT> Edge e = edgePool.checkOut();<a name="line.446"></a>
<FONT color="green">447</FONT> e.setBelongsToGraph(this);<a name="line.447"></a>
<FONT color="green">448</FONT> e.setEdge((Node)parent, (Node)child, Edge.PHRASE_STRUCTURE_EDGE);<a name="line.448"></a>
<FONT color="green">449</FONT> graphEdges.add(e);<a name="line.449"></a>
<FONT color="green">450</FONT> return e;<a name="line.450"></a>
<FONT color="green">451</FONT> } else {<a name="line.451"></a>
<FONT color="green">452</FONT> throw new MaltChainedException("Parent or child node is not of correct node type.");<a name="line.452"></a>
<FONT color="green">453</FONT> }<a name="line.453"></a>
<FONT color="green">454</FONT> }<a name="line.454"></a>
<FONT color="green">455</FONT> <a name="line.455"></a>
<FONT color="green">456</FONT> public void update(Observable o, Object arg) {<a name="line.456"></a>
<FONT color="green">457</FONT> if (o instanceof Edge && mapping != null) {<a name="line.457"></a>
<FONT color="green">458</FONT> try {<a name="line.458"></a>
<FONT color="green">459</FONT> mapping.update(this, (Edge)o, arg);<a name="line.459"></a>
<FONT color="green">460</FONT> } catch (MaltChainedException ex) {<a name="line.460"></a>
<FONT color="green">461</FONT> if (SystemLogger.logger().isDebugEnabled()) {<a name="line.461"></a>
<FONT color="green">462</FONT> SystemLogger.logger().debug("",ex);<a name="line.462"></a>
<FONT color="green">463</FONT> } else {<a name="line.463"></a>
<FONT color="green">464</FONT> SystemLogger.logger().error(ex.getMessageChain());<a name="line.464"></a>
<FONT color="green">465</FONT> }<a name="line.465"></a>
<FONT color="green">466</FONT> System.exit(1);<a name="line.466"></a>
<FONT color="green">467</FONT> }<a name="line.467"></a>
<FONT color="green">468</FONT> }<a name="line.468"></a>
<FONT color="green">469</FONT> }<a name="line.469"></a>
<FONT color="green">470</FONT> <a name="line.470"></a>
<FONT color="green">471</FONT> public LosslessMapping getMapping() {<a name="line.471"></a>
<FONT color="green">472</FONT> return mapping;<a name="line.472"></a>
<FONT color="green">473</FONT> }<a name="line.473"></a>
<FONT color="green">474</FONT> <a name="line.474"></a>
<FONT color="green">475</FONT> public void setMapping(LosslessMapping mapping) {<a name="line.475"></a>
<FONT color="green">476</FONT> this.mapping = mapping;<a name="line.476"></a>
<FONT color="green">477</FONT> }<a name="line.477"></a>
<FONT color="green">478</FONT> <a name="line.478"></a>
<FONT color="green">479</FONT> public void addLabel(Element element, String labelFunction, String label) throws MaltChainedException {<a name="line.479"></a>
<FONT color="green">480</FONT> super.addLabel(element, labelFunction, label);<a name="line.480"></a>
<FONT color="green">481</FONT> }<a name="line.481"></a>
<FONT color="green">482</FONT> <a name="line.482"></a>
<FONT color="green">483</FONT> public void removePhraseStructureEdge(PhraseStructureNode parent, PhraseStructureNode child) throws MaltChainedException {<a name="line.483"></a>
<FONT color="green">484</FONT> if (parent == null || child == null) {<a name="line.484"></a>
<FONT color="green">485</FONT> throw new MaltChainedException("Parent or child node is missing.");<a name="line.485"></a>
<FONT color="green">486</FONT> } else if (parent instanceof NonTerminalNode && !child.isRoot()) {<a name="line.486"></a>
<FONT color="green">487</FONT> for (Edge e : graphEdges) {<a name="line.487"></a>
<FONT color="green">488</FONT> if (e.getSource() == parent && e.getTarget() == child) {<a name="line.488"></a>
<FONT color="green">489</FONT> e.clear();<a name="line.489"></a>
<FONT color="green">490</FONT> graphEdges.remove(e);<a name="line.490"></a>
<FONT color="green">491</FONT> if (e instanceof GraphEdge) {<a name="line.491"></a>
<FONT color="green">492</FONT> edgePool.checkIn(e);<a name="line.492"></a>
<FONT color="green">493</FONT> }<a name="line.493"></a>
<FONT color="green">494</FONT> }<a name="line.494"></a>
<FONT color="green">495</FONT> }<a name="line.495"></a>
<FONT color="green">496</FONT> } else {<a name="line.496"></a>
<FONT color="green">497</FONT> throw new SyntaxGraphException("Head node is not a root node or a terminal node.");<a name="line.497"></a>
<FONT color="green">498</FONT> }<a name="line.498"></a>
<FONT color="green">499</FONT> }<a name="line.499"></a>
<FONT color="green">500</FONT> <a name="line.500"></a>
<FONT color="green">501</FONT> public boolean isContinuous() {<a name="line.501"></a>
<FONT color="green">502</FONT> for (int index : nonTerminalNodes.keySet()) {<a name="line.502"></a>
<FONT color="green">503</FONT> NonTerminalNode node = nonTerminalNodes.get(index);<a name="line.503"></a>
<FONT color="green">504</FONT> <a name="line.504"></a>
<FONT color="green">505</FONT> if (!node.isContinuous()) {<a name="line.505"></a>
<FONT color="green">506</FONT> return false;<a name="line.506"></a>
<FONT color="green">507</FONT> }<a name="line.507"></a>
<FONT color="green">508</FONT> }<a name="line.508"></a>
<FONT color="green">509</FONT> return true;<a name="line.509"></a>
<FONT color="green">510</FONT> }<a name="line.510"></a>
<FONT color="green">511</FONT> <a name="line.511"></a>
<FONT color="green">512</FONT> public boolean isContinuousExcludeTerminalsAttachToRoot() {<a name="line.512"></a>
<FONT color="green">513</FONT> for (int index : nonTerminalNodes.keySet()) {<a name="line.513"></a>
<FONT color="green">514</FONT> NonTerminalNode node = nonTerminalNodes.get(index);<a name="line.514"></a>
<FONT color="green">515</FONT> if (!node.isContinuousExcludeTerminalsAttachToRoot()) {<a name="line.515"></a>
<FONT color="green">516</FONT> return false;<a name="line.516"></a>
<FONT color="green">517</FONT> }<a name="line.517"></a>
<FONT color="green">518</FONT> }<a name="line.518"></a>
<FONT color="green">519</FONT> return true;<a name="line.519"></a>
<FONT color="green">520</FONT> }<a name="line.520"></a>
<FONT color="green">521</FONT> <a name="line.521"></a>
<FONT color="green">522</FONT> // public void makeContinuous() throws MaltChainedException {<a name="line.522"></a>
<FONT color="green">523</FONT> // if (root != null) {<a name="line.523"></a>
<FONT color="green">524</FONT> // root.reArrangeChildrenAccordingToLeftAndRightProperDesendant();<a name="line.524"></a>
<FONT color="green">525</FONT> // }<a name="line.525"></a>
<FONT color="green">526</FONT> // }<a name="line.526"></a>
<FONT color="green">527</FONT> <a name="line.527"></a>
<FONT color="green">528</FONT> public String toStringTerminalNode(TokenNode node) {<a name="line.528"></a>
<FONT color="green">529</FONT> final StringBuilder sb = new StringBuilder();<a name="line.529"></a>
<FONT color="green">530</FONT> final DependencyNode depnode = node;<a name="line.530"></a>
<FONT color="green">531</FONT> <a name="line.531"></a>
<FONT color="green">532</FONT> sb.append(node.toString().trim());<a name="line.532"></a>
<FONT color="green">533</FONT> if (depnode.hasHead()) {<a name="line.533"></a>
<FONT color="green">534</FONT> sb.append('\t');<a name="line.534"></a>
<FONT color="green">535</FONT> try {<a name="line.535"></a>
<FONT color="green">536</FONT> sb.append(depnode.getHead().getIndex());<a name="line.536"></a>
<FONT color="green">537</FONT> sb.append('\t');<a name="line.537"></a>
<FONT color="green">538</FONT> sb.append(depnode.getHeadEdge().toString());<a name="line.538"></a>
<FONT color="green">539</FONT> } catch (MaltChainedException e) {<a name="line.539"></a>
<FONT color="green">540</FONT> System.out.println(e);<a name="line.540"></a>
<FONT color="green">541</FONT> }<a name="line.541"></a>
<FONT color="green">542</FONT> }<a name="line.542"></a>
<FONT color="green">543</FONT> sb.append('\n');<a name="line.543"></a>
<FONT color="green">544</FONT> <a name="line.544"></a>
<FONT color="green">545</FONT> return sb.toString();<a name="line.545"></a>
<FONT color="green">546</FONT> }<a name="line.546"></a>
<FONT color="green">547</FONT> <a name="line.547"></a>
<FONT color="green">548</FONT> public String toStringNonTerminalNode(NonTerminalNode node) {<a name="line.548"></a>
<FONT color="green">549</FONT> final StringBuilder sb = new StringBuilder();<a name="line.549"></a>
<FONT color="green">550</FONT> <a name="line.550"></a>
<FONT color="green">551</FONT> sb.append(node.toString().trim());<a name="line.551"></a>
<FONT color="green">552</FONT> sb.append('\n');<a name="line.552"></a>
<FONT color="green">553</FONT> Iterator<Edge> ie = ((Node)node).getOutgoingEdgeIterator();<a name="line.553"></a>
<FONT color="green">554</FONT> while (ie.hasNext()) {<a name="line.554"></a>
<FONT color="green">555</FONT> Edge e = ie.next();<a name="line.555"></a>
<FONT color="green">556</FONT> if (e.getTarget() instanceof TokenNode) {<a name="line.556"></a>
<FONT color="green">557</FONT> sb.append(" T");<a name="line.557"></a>
<FONT color="green">558</FONT> sb.append(e.getTarget().getIndex());<a name="line.558"></a>
<FONT color="green">559</FONT> }<a name="line.559"></a>
<FONT color="green">560</FONT> if (e.getTarget() instanceof NonTerminalNode) {<a name="line.560"></a>
<FONT color="green">561</FONT> sb.append(" N");<a name="line.561"></a>
<FONT color="green">562</FONT> sb.append(e.getTarget().getIndex());<a name="line.562"></a>
<FONT color="green">563</FONT> }<a name="line.563"></a>
<FONT color="green">564</FONT> sb.append('\t');<a name="line.564"></a>
<FONT color="green">565</FONT> sb.append(e.toString());<a name="line.565"></a>
<FONT color="green">566</FONT> sb.append('\n');<a name="line.566"></a>
<FONT color="green">567</FONT> }<a name="line.567"></a>
<FONT color="green">568</FONT> return sb.toString();<a name="line.568"></a>
<FONT color="green">569</FONT> }<a name="line.569"></a>
<FONT color="green">570</FONT> <a name="line.570"></a>
<FONT color="green">571</FONT> public String toString() {<a name="line.571"></a>
<FONT color="green">572</FONT> StringBuilder sb = new StringBuilder();<a name="line.572"></a>
<FONT color="green">573</FONT> for (int index : terminalNodes.keySet()) {<a name="line.573"></a>
<FONT color="green">574</FONT> sb.append(toStringTerminalNode(terminalNodes.get(index)));<a name="line.574"></a>
<FONT color="green">575</FONT> }<a name="line.575"></a>
<FONT color="green">576</FONT> sb.append('\n');<a name="line.576"></a>
<FONT color="green">577</FONT> sb.append(toStringNonTerminalNode((NonTerminalNode)getPhraseStructureRoot()));<a name="line.577"></a>
<FONT color="green">578</FONT> for (int index : nonTerminalNodes.keySet()) {<a name="line.578"></a>
<FONT color="green">579</FONT> sb.append(toStringNonTerminalNode(nonTerminalNodes.get(index)));<a name="line.579"></a>
<FONT color="green">580</FONT> }<a name="line.580"></a>
<FONT color="green">581</FONT> return sb.toString();<a name="line.581"></a>
<FONT color="green">582</FONT> }<a name="line.582"></a>
<FONT color="green">583</FONT> }<a name="line.583"></a>
</PRE>
</BODY>
</HTML>